Crossdocking - JIT scheduling with time windows

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review

View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)1342-1351
Journal / PublicationJournal of the Operational Research Society
Volume55
Issue number12
StatePublished - Dec 2004
Externally publishedYes

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.

Research Area(s)

  • Crossdock, Heuristics, Just-in-time scheduling, Machine scheduling

Citation Format(s)

Crossdocking - JIT scheduling with time windows. / Li, Y.; Lim, A.; Rodrigues, B.

In: Journal of the Operational Research Society, Vol. 55, No. 12, 12.2004, p. 1342-1351.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review