Crossdocking: JIT Scheduling with Time Windows
Publication Type
Journal Article
Publication Date
12-2004
Abstract
In this paper, we study a problem central to crossdocking that aims to eliminate or minimize storage and order picking activity using JIT scheduling. The problem is modelled naturally as a machine scheduling problem. As the problem is NP-hard, and for real-time applications, we designed and implemented two heuristics. The first uses Squeaky Wheel Optimization embedded in a Genetic Algorithm and the second uses Linear Programming within a Genetic Algorithm. Both heuristics offer good solutions in experiments where comparisons are made with the CPLEX solver
Keywords
crossdock, machine scheduling, just-in-time scheduling, heuristics
Discipline
Operations and Supply Chain Management
Research Areas
Operations Management
Publication
Journal of the Operational Research Society
Volume
55
Issue
12
First Page
1342
Last Page
1351
ISSN
0160-5682
Identifier
10.1057/palgrave.jors.2601812
Publisher
Palgrave
Citation
LI, Yanzhi; LIM, Andrew; and Rodrigues, Brian.
Crossdocking: JIT Scheduling with Time Windows. (2004). Journal of the Operational Research Society. 55, (12), 1342-1351.
Available at: https://ink.library.smu.edu.sg/lkcsb_research/2616
Additional URL
https://doi.org/10.1057/palgrave.jors.2601812