Crane scheduling with non-crossing constraint

Y Zhu () and A Lim
Additional contact information
Y Zhu: University of California
A Lim: Hong Kong University of Science and Technology, Clear Water Bay

Journal of the Operational Research Society, 2006, vol. 57, issue 12, 1464-1471

Abstract: Abstract In this paper, we examine crane scheduling for ports. This important component of port operations management is studied when the non-crossing spatial constraint, which is common to crane operations, is considered. We assume that ships can be divided into holds and that cranes can move from hold to hold but jobs are not pre-emptive, so that only one crane can work on one hold or job to complete it. Our objective is to minimize the latest completion time for all jobs. We formulate this problem as an integer programming problem. We provide the proof that this problem is NP-complete and design a branch-and-bound algorithm to obtain optimal solutions. A simulated annealing meta-heuristic with effective neighbourhood search is designed to find good solutions in larger size instances. The elaborate experimental results show that the branch-and-bound algorithm runs much faster than CPLEX and the simulated annealing approach can obtain near optimal solutions for instances of various sizes.

Keywords: heuristic; optimization; search; scheduling (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2602110 Abstract (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:pal:jorsoc:v:57:y:2006:i:12:d:10.1057_palgrave.jors.2602110

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2602110

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().