Publication:
Constraint programming approach to quay crane scheduling problem

Placeholder

School / College / Institute

Organizational Unit

Program

KU Authors

Co-Authors

N/A

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

This study presents a constraint programming (CP) model for the quay crane scheduling problem (QCSP), which occurs at container terminals, with realistic constraints such as safety margins, travel times and precedence relations. Next, QCSP with time windows and integrated crane assignment and scheduling problem, are discussed. The performance of the CP model is compared with that of algorithms presented in QCSP literature. The results of the computational experiments indicate that the CP model is able to produce good results while reducing the computational time, and is a robust and flexible alternative for different types of crane scheduling problems.

Source

Publisher

Pergamon-Elsevier Science Ltd

Subject

Economics, Engineering, Civil engineering, Operations research, Management science, Transportation, Transportation science

Citation

Has Part

Source

Transportation Research Part E-Logistics And Transportation Review

Book Series Title

Edition

DOI

10.1016/j.tre.2013.08.006

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

0

Downloads

View PlumX Details