Article ID: | iaor20063360 |
Country: | United States |
Volume: | 52 |
Issue: | 4 |
Start Page Number: | 312 |
End Page Number: | 320 |
Publication Date: | Jun 2005 |
Journal: | Naval Research Logistics |
Authors: | Qi Xiangtong |
Keywords: | programming: branch and bound |
Logistics scheduling refers to the problems where the decisions of job scheduling and transportation are integrated in a single framework. In this paper, we discuss a logistics scheduling model where the raw material is delivered to the shop in batches. By making the batching and scheduling decisions simultaneously, the total inventory and batch setup cost can be reduced. We study different models on this issue, present complexity analysis and optimal algorithms, and conduct computational experiments. Some managerial insights are observed.