IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v8y2014i5p695-715.html
   My bibliography  Save this article

Heuristics for predictive hoist scheduling problems

Author

Listed:
  • Qiao Zhang
  • Hervé Manier
  • Marie-Ange Manier
  • Christelle Bloch

Abstract

In this paper, we consider hoist scheduling problems in a job shop environment. For each job several operations can be operated on tanks, and their processing times are bounded. The objective is to assign resources to both processing and transport operations and then to schedule those tasks on each resource, without storage, while minimising makespan. A disjunctive graph is used to model the problem. It contains processing nodes, transportation nodes, and arcs to represent lower and upper bounds on processing and transportation times. Then a modified shifting bottleneck algorithm with a simple repair is used for finding sequences on resources. It is coupled with a first heuristic which repairs some sequences of transportation tasks. A second heuristic assigns and schedules transportation tasks one by one while arbitrating disjunctions. Various experiments on benchmarks show that our model and method are able to provide satisfying results. [Received 15 June 2012; Revised 3 January 2013; Accepted 7 June 2013]

Suggested Citation

  • Qiao Zhang & Hervé Manier & Marie-Ange Manier & Christelle Bloch, 2014. "Heuristics for predictive hoist scheduling problems," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 8(5), pages 695-715.
    • Handle: RePEc:ids:eujine:v:8:y:2014:i:5:p:695-715
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=65733
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:eujine:v:8:y:2014:i:5:p:695-715. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.