Crossdocking - JIT scheduling with time windows
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
|Journal / Publication||Journal of the Operational Research Society|
|Publication status||Published - Dec 2004|
|Link to Scopus||https://www.scopus.com/record/display.uri?eid=2-s2.0-9744228000&origin=recordpage|
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, Heuristics, Just-in-time scheduling, Machine scheduling