Heuristics for predictive hoist scheduling problems

Qiao Zhang, Hervé Manier, Marie-Ange Manier and Christelle Bloch

European Journal of Industrial Engineering, 2014, vol. 8, issue 5, 695-715

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]

Keywords: hoist scheduling problem; HSP; bounded processing times; shifting bottleneck procedure; disjunctive graph; heuristics; predictive scheduling; job shop scheduling; resource allocation; processing tasks; transport tasks. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=65733 (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:ids:eujine:v:8:y:2014:i:5:p:695-715

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().