On the scheduling of handling equipment in automated container terminals

Iñigo L. Ansorena

International Journal of Operational Research, 2021, vol. 42, issue 3, 277-291

Abstract: This paper deals with the application of the flow shop scheduling problem (FSSP) to automated container terminals. After the description of operations between the quay line and the storage yard we analyse the flow of containers through six well established heuristic methods. Additionally, we apply a full enumeration mechanism to solve the FSSP. This technique enumerates all permutation schedules and picks the best one based on the specified criterion. A numerical illustration is given to clarify the application of FSSP techniques to container terminals. The paper suggests that the selection of the best heuristic is crucial to increase productivity and achieve goals, since it allows time savings around 20%-30% depending on the method used.

Keywords: flow shop; sequencing problem; container terminals; heuristic method; automation; guided vehicles; stacking cranes; quay cranes; operation time; time savings. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=119406 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:42:y:2021:i:3:p:277-291

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().