Scheduling multiple factory cranes on a common track

Ben Peterson, Iiro Harjunkoski, Samid Hoda, J. N. Hooker*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

18 Citations (Scopus)

Abstract

A heuristic algorithm is presented for scheduling the movement of multiple factory cranes mounted on a common track. The cranes must complete a sequence of tasks at locations along the track without crossing paths, while adhering as closely as possible to a factory production schedule. The algorithm creates a decision tree of possible states of the crane system, which evolves over time as tasks are assigned and sequenced. By identifying and removing inferior states from the tree, the algorithm efficiently generates provably optimal or near-optimal crane schedules, depending on the complexity of the problem instance.

Original languageEnglish
Pages (from-to)102-112
Number of pages11
JournalComputers and Operations Research
Volume48
DOIs
Publication statusPublished - 2014
MoE publication typeA1 Journal article-refereed

Keywords

  • Crane scheduling heuristic
  • Factory crane scheduling
  • State space reduction

Fingerprint

Dive into the research topics of 'Scheduling multiple factory cranes on a common track'. Together they form a unique fingerprint.

Cite this