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.
No takes yet. Share an insight, caveat, or question.
Li et al. (2004) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: