Crossdocking: JIT Scheduling with Time Windows

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 implemen...

Full description

Saved in:
Bibliographic Details
Main Authors: LI, Yanzhi, LIM, Andrew, Rodrigues, Brian
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2004
Subjects:
crossdock
machine scheduling
just-in-time scheduling
heuristics
Operations and Supply Chain Management
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/2616
https://www.jstor.org/stable/4101853
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Description
Summary: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

Similar Items