Crossdocking—JIT scheduling with time windows |
| |
Authors: | Y Li A Lim B Rodrigues |
| |
Affiliation: | 1.Hong Kong University of Science and Technology,Clearwater Bay,Hong Kong;2.Singapore Management University,Singapore |
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|