One-dimensional vehicle scheduling with a front-end depot and non-crossing constraints

Authors:
Simon Emde;Nils Boysen
Affiliations:
Lehrstuhl für Operations Management, Friedrich-Schiller-Universität Jena, Jena, Germany 07743;Lehrstuhl für Operations Management, Friedrich-Schiller-Universität Jena, Jena, Germany 07743
Venue:
OR Spectrum
Year:
2014

Citing 5
Cited 0

The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints

Management Science
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Single hoist cyclic scheduling with multiple tanks: a material handling solution

Computers and Operations Research - Special issue: Emerging economics
Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach

Operations Research
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the scheduling problem of multiple vehicles executing a given set of jobs in parallel along a shared pathway. The job set consists of storage and retrieval tasks, transporting goods between a front-end depot and given storage locations on the line. Non-crossing constraints need to be applied to the vehicle movements. This problem setting is relevant when a train is loaded with containers by multiple straddle carriers on the landside of a container terminal. Other potential applications exist in multi-shuttle automated storage and retrieval systems and multi-stage production systems where items are transported by parallel hoists. We formalize the problem, analyze its computational complexity, and develop exact and heuristic solution procedures.