Crossdocking: JIT Scheduling with Time Windows
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
crossdock, machine scheduling, just-in-time scheduling, heuristics
Operations and Supply Chain Management
Journal of the Operational Research Society
LI, Yanzhi; LIM, Andrew; and Rodrigues, Brian.
Crossdocking: JIT Scheduling with Time Windows. (2004). Journal of the Operational Research Society. 55, (12), 1342-1351. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2616