Optimization of Container Terminal Unloading Operations Based Upon Multistage Flexible Flowshop Scheduling

Erick Massami; Zhi Hong Jin

doi:10.4028/www.scientific.net/AMM.97-98.633

Paper Titles

Anti-Skid Thin Layer on Asphalt Pavement of Super Long Downgrades
p.611

A New Genetic Algorithm for Continuous Berth and Quay Crane Allocation Problem
p.619

Research on Regional Logistics Spatial Evolution Based on Geographic Simulation System
p.623

An Investigation of the Planning and Designing of Road Network in Logistical Parks
p.629

Optimization of Container Terminal Unloading Operations Based Upon Multistage Flexible Flowshop Scheduling
p.633

Applying Genetic Algorithm for Min-Max Vehicle Routing Problem
p.640

Study on Construction Order of Logistics Park Based on Combined Model of Analytic Hierarchy Process and Gray Comprehensive Evaluation
p.644

Studies on Risk Pre-Warning and Emergency Treatment of Thermal Coal Supply Chain
p.648

The Research on Location of Multi-Level Network Distribution Centers
p.653

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 97-98Optimization of Container Terminal Unloading...

Optimization of Container Terminal Unloading Operations Based Upon Multistage Flexible Flowshop Scheduling

Abstract:

Modeling unloading operations at maritime container terminals has increasingly become crucial to container terminal planners. This paper presents the multistage flexible flowshop scheduling problem (MFFSP). The objective of the MFFSP is to determine a schedule that minimizes the schedule length for a given number of containers and handling equipment over a finite planning horizon. Since the MFFSP is NP-hard in the strong sense, metaheuristic solution method is employed. A global lower bound to measure the efficiency of the metaheuristic procedure is derived. The optimization procedure is based on Genetic Algorithm (GA) which is used to estimate the minimum schedule length for a number of problem instances. Computational experiments validate the developed MFFSP.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 97-98)

Pages:

633-639

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.97-98.633

Citation:

Cite this paper

Online since:

September 2011

Authors:

Erick Massami, Zhi Hong Jin

Keywords:

Container Terminal, Genetic Algorithm (GA), Multistage Flexible Flowshop, Schedule Length, Scheduling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Z.Yang and Q.Zeng. Integrating simulation and optimization to schedule loading operations in container terminals. Computers and Operations Research, Vol.36(2009), pp.1935-1944.

DOI: 10.1016/j.cor.2008.06.010

Google Scholar

[2] R. Ruiz, J.Antonio and V.Rodríguez. The hybrid flow shop scheduling problem. European Journal of Operational Research, Vol.205(2010),pp.1-18.

DOI: 10.1016/j.ejor.2009.09.024

Google Scholar

[3] L.Chen, N.Bostel, P.Dejax, J.Cai and L.Xi. A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. European Journal of Operational Research, Vol.181(2007),pp.40-58.

DOI: 10.1016/j.ejor.2006.06.033

Google Scholar

[4] D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. ( Addison-Wesley Publication, Reading, 1989)

Google Scholar

[5] L.Davis. Handbook of genetic algorithms. (Van Nostrand Reinhold Publication Company, Network, 1991)

Google Scholar

[6] Z.Jin, K.Ohno, T.Ito and S.E. Elmaghraby. Scheduling Hybrid Flowshops in Printed Circuit Board Assembly Lines. Production and Operations Management, Vol.2(2002),pp.216-230.

DOI: 10.1111/j.1937-5956.2002.tb00492.x

Google Scholar

[7] D.L. Santos, J.L. Hunsucker and D.E. Deal.1995. Global lower bounds for flowshop with multiple processors. European Journal of Operational Research, Vol.80(1995), pp.112-120.

DOI: 10.1016/0377-2217(93)e0326-s

Google Scholar