Article ID: | iaor2004207 |
Country: | United States |
Volume: | 50 |
Issue: | 3 |
Start Page Number: | 239 |
End Page Number: | 256 |
Publication Date: | Apr 2003 |
Journal: | Naval Research Logistics |
Authors: | Lee Chung-Yee, Chen Zhi-Long |
Keywords: | distribution, scheduling, transportation: road |
This paper studies a scheduling problem arising in a beef distribution system where pallets of various types of beef products in the warehouse are first depalletized and then individual cases are loaded via conveyors to the trucks which deliver beef products to various customers. Given each customer's demand for each type of beef, the problem is to find a depalletizing and truck loading schedule that fills all the demands at a minimum total cost. We first show that the general problem where there are multiple trucks and each truck covers multiple customers is strongly NP-hard. Then we propose polynomial-time algorithms for the case where there are multiple trucks, each covering only one customer, and the case where there is only one truck covering multiple customers. We also develop an optimal dynamic programming algorithm and a heuristic for solving the general problem. By comparing to the optimal solutions generated by the dynamic programming algorithm, the heuristic is shown to be capable of generating near optimal solutions quickly.