Scheduling multiple factory cranes on a common track

Peterson, Ben; Harjunkoski, Iiro; Hoda, Samid; Hooker, John

doi:10.1016/j.cor.2014.03.005

Cited by 33 publications

(8 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The HSP is related to but distinct from the problems of (un)loading ships in a container terminal with port and yard cranes [10,11], and of scheduling cranes in a factory. For the latter problem, [15] present a dynamic decision tree approach, which would be interesting to consider for the HSP.…”

Section: Related Workmentioning

confidence: 99%

A new constraint programming model and solving for the cyclic hoist scheduling problem

Wallace

Yorke-Smith

2020

Constraints

View full text Add to dashboard Cite

The cyclic hoist scheduling problem (CHSP) is a well-studied optimisation problem due to its importance in industry. Despite the wide range of solving techniques applied to the CHSP and its variants, the models have remained complicated and inflexible, or have failed to scale up with larger problem instances. This article re-examines modelling of the CHSP and proposes a new simple, flexible constraint programming formulation. We compare current state-of-the-art solving technologies on this formulation, and show that modelling in a high-level constraint language, MiniZinc, leads to both a simple, generic model and to computational results that outperform the state of the art. We further demonstrate that combining integer programming and lazy clause generation, using the multiple cores of modern processors, has potential to improve over either solving approach alone.

show abstract

Section: Related Workmentioning

confidence: 99%

A new constraint programming model and solving for the cyclic hoist scheduling problem

Wallace

Yorke-Smith

2020

Constraints

View full text Add to dashboard Cite

show abstract

“…For this purpose, no restriction, i.e., each shuttle vehicle is able to carry out any job on the tier (see section 2.2), is chosen for preselection. For job allocation, the block sequencing algorithm based on [12], originally developed for the control of overhead cranes, is used and is now adapted to the application on the tier of a high-powered AVSRS. Functionality.…”

Section: Control Algorithm For Coordinating Multiple Shuttle Vehiclesmentioning

confidence: 99%

Vehicle Coordination and Configuration in High-powered Automated Vehicle Storage and Retrieval Systems

Habl¹,

Lienert²,

Pradines³

et al. 2020

SNE

View full text Add to dashboard Cite

The growing demand for increased flexibility and throughput capacity of automated warehouses is driving the implementation of rail-guided automated vehicle storage and retrieval systems (AVSRSs). A new type of AVSRS is capable of further increased performance by utilizing multiple vehicles along one rail instead of using only a single vehicle per aisle and tier. In this work, we introduce the shuttle vehicle scheduling problem (SVSP) in AVSRSs and present methods to solve the SVSP. We conduct a series of simulation experiments to show the performance improvement of horizontal transportation in various configurations of this new type of AVSRS and discuss main benefits of deploying high-powered AVSRSs.

show abstract

“…Also, Kung et al (2014) consider order scheduling of multiple stacker cranes on common rails in an automated storage and retrieval system. Peterson et al (2014) propose a method for scheduling multiple factory cranes that operate on a common track.…”

Section: Literature Reviewmentioning

confidence: 99%

Sequencing dual-spreader crane operations: Mathematical formulation and heuristic algorithm

Lashkari

Petering

2017

European Journal of Operational Research

View full text Add to dashboard Cite

This paper investigates the problem of scheduling a dual-spreader crane when lifts are subject to a weight limit. A mathematical model is formulated and a fast method for computing a lower bound on the optimal value is proposed. An efficient heuristic approach is designed and subsequently built into a simulated annealing framework to solve the problem. The optimization and heuristic approaches are tested on problem instances of various sizes. The results indicate that the optimization approach produces proven optimal solutions to small-sized instances but fails to solve instances of practical meaning. The heuristic approach can easily match the performance of the optimization approach for small instances and outperforms the optimization approach when tackling larger instances. On average, the heuristic approach produces solutions whose objective values are within 6% of the lower bound.

show abstract

Scheduling multiple factory cranes on a common track

Cited by 33 publications

References 26 publications

A new constraint programming model and solving for the cyclic hoist scheduling problem

A new constraint programming model and solving for the cyclic hoist scheduling problem

Vehicle Coordination and Configuration in High-powered Automated Vehicle Storage and Retrieval Systems

Sequencing dual-spreader crane operations: Mathematical formulation and heuristic algorithm

Contact Info

Product

Resources

About