TY - JOUR
T1 - Crossdocking - JIT scheduling with time windows
AU - Li, Y.
AU - Lim, A.
AU - Rodrigues, B.
PY - 2004/12
Y1 - 2004/12
N2 - 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.
AB - 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.
KW - Crossdock
KW - Heuristics
KW - Just-in-time scheduling
KW - Machine scheduling
UR - http://www.scopus.com/inward/record.url?scp=9744228000&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-9744228000&origin=recordpage
U2 - 10.1057/palgrave.jors.2601812
DO - 10.1057/palgrave.jors.2601812
M3 - RGC 21 - Publication in refereed journal
SN - 0160-5682
VL - 55
SP - 1342
EP - 1351
JO - Journal of the Operational Research Society
JF - Journal of the Operational Research Society
IS - 12
ER -