Two Efficient Constructive Heuristics for Scheduling Trucks at Crossdocking Terminals
This paper studies an important crossdocking planning operation which is the scheduling of trucks at crossdocking terminals. The operation consists of two optimization problems: truck sequencing and door assignment. The problems are integrated and formulated as a machine scheduling problem. Two constructive heuristics are developed to address truck scheduling: a dependency ranking (DR) heuristic for truck sequencing and a machine. tness (MF) heuristic for door assignment. The solutions generated by the heuristics are compared with those of an MIP model formulated for the same problem. Considering the constructive nature of the proposed heuristics where no optimization technique has been employed, the quality of results compared to that of the CPLEX solver is quite promising. Also, the heuristics maintain scalability in solution time as the problem size increases to large scales.
Mojtaba Shakeri Malcolm Yoke Hean Low Zhengping Li Eng Wah Lee
School of Computer Engineering,Nanyang Technological University, Singapore 639798 Beijing CFLP Logistics Academy, Beijing 100834 Planning and Operations Management Group, Singapore Institute of Manufacturing Technology, Singapore
国际会议
青岛
英文
177-182
2010-07-15（万方平台首次上网日期，不代表论文的发表时间）