A note on a model for quay crane scheduling with non-crossing constraints

Alberto Santini, Henrik Alsing Friberg, Stefan Røpke

    Research output: Contribution to journalJournal articleResearchpeer-review

    304 Downloads (Pure)


    This article studies the quay crane scheduling problem with non-crossing constraints, which is an operational problem that arises in container terminals. An enhancement to a mixed integer programming model for the problem is proposed and a new class of valid inequalities is introduced. Computational results show the effectiveness of these enhancements in solving the problem to optimality.
    Original languageEnglish
    JournalEngineering Optimization
    Issue number6
    Pages (from-to)860-865
    Number of pages6
    Publication statusPublished - 2015


    • Container terminals
    • Exact algorithms
    • Mixed integer programming
    • Non-crossing constraints
    • Quay crane scheduling
    • Containers
    • Cranes
    • Integer programming
    • Port terminals
    • Problem solving
    • Railroad yards and terminals
    • Container terminal
    • Non-crossing constraint
    • Scheduling

    Cite this