Scheduling multiple factory cranes on a common track
| Autor: | Ben Peterson, Iiro Harjunkoski, John N. Hooker, Samid Hoda |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Schedule
Sequence General Computer Science ComputingMethodologies_SIMULATIONANDMODELING Computer science Distributed computing Real-time computing ComputerApplications_COMPUTERSINOTHERSYSTEMS Management Science and Operations Research Track (rail transport) Scheduling (computing) Tree (data structure) Modeling and Simulation Production schedule Factory (object-oriented programming) |
| Zdroj: | Computers & Operations Research. 48:102-112 |
| ISSN: | 0305-0548 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect