Routing two stacking cranes with predetermined container sequences

Dirk Briskorn ()
Additional contact information
Dirk Briskorn: Bergische Universität Wuppertal

Journal of Scheduling, 2021, vol. 24, issue 4, No 1, 367-380

Abstract: Abstract The scheduling of gantry cranes with respect to mutual interference has received considerable attention in recent years. We consider a subproblem which arises when each crane has a sequence of tasks to be assigned. The problem is concerned with resolving the interference between two cranes by determining which crane avoids the other in order to let it complete its next task first. We provide a fairly general problem framework accounting for different crane systems and various side constraints. We assume a cost function for each task that determines the cost of completing the task at a specific point in time. We then distinguish between the objectives to minimize both the total cost and the maximum cost among tasks. A general dynamic programming framework is provided which allows us to solve all problem versions in pseudo-polynomial time. Furthermore, we show that while the general problem aiming for minimum total cost is binary NP-hard, the general problem aiming for minimum maximum cost can be solved in polynomial time. Finally, we address two important special cases of the former, and we show that they can be solved in polynomial time as well.

Keywords: Port operations; Container logistics; Gantry crane scheduling; Resolving mutual interference (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-021-00689-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jsched:v:24:y:2021:i:4:d:10.1007_s10951-021-00689-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-021-00689-4

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().