Abstract Typical cargo ships spend 60% of their time in port, costing their owners about $1000 per hour. In this paper, we attack such costs with a method to speed loading and unloading. We model the need for container handling as generic “work,” which cranes can do at a constant rate. Each hold of each ship has a given amount of this work and cranes can interrupt their work on individual holds without any loss of efficiency. In the parlance of scheduling theory, this constitutes an “open shop” with parallel, identical machines, where jobs consist of independent, single-stage, preemptable tasks. Practical problems often involve only a few ships but many holds; the complication of preemptable tasks makes them very complex. The paper presents a branch and bound method which, for this model, minimizes delay costs (weighted tardiness). As part of the method, we extend previous solutions to the feasibility problem of preemptive machine scheduling (to cases where multiple machines can work simultaneously on a single task). Computational results and extensions to more complicated problems are offered. Certain concepts developed here may also be applicable to other problems, both in scheduling and elsewhere. In particular, they may lead to optimal solutions of problems for which feasibility determination methods already exist.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A branch and bound solution method for the crane scheduling problem


    Contributors:

    Published in:

    Publication date :

    1989-05-18


    Size :

    14 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    The crane scheduling problem

    Daganzo, Carlos F. | Elsevier | 1988


    Solving blocking flowshop scheduling problem with branch and bound algorithm

    Toumi, Said / Jarboui, Bassem / Eddaly, Mansour et al. | IEEE | 2013


    A branch and bound algorithm for the multiple depot vehicle scheduling problem

    Carpaneto, G. / Dell'Amico, M. / Fischetti, M. et al. | Tema Archive | 1989



    Scheduling of airport runway operations using stochastic branch and bound methods

    Sölveling, Gustaf / Clarke, John-Paul | Elsevier | 2014