Single-machine batch delivery scheduling with an assignable common due window |
| |
Authors: | Yunqiang Yin TCE Cheng Chou-Jung Hsu Chin-Chia Wu |
| |
Institution: | 1. State Key Laboratory Breeding Base of Nuclear Resources and Environment, East China Institute of Technology, Nanchang 330013, China;2. School of Sciences, East China Institute of Technology, Fuzhou, Jiangxi 344000, China;3. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;4. Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou 542, Taiwan;5. Department of Statistics, Feng Chia University, Taichung, Taiwan |
| |
Abstract: | This paper addresses a batch delivery single-machine scheduling problem in which jobs have an assignable common due window. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due window under a given schedule. There is no capacity limit on each delivery batch, and the cost per batch delivery is fixed and independent of the number of jobs in the batch. The objective is to find the optimal size and location of the window, the optimal dispatch date for each job, as well as an optimal job sequence to minimize a cost function based on earliness, tardiness, holding time, window location, window size, and batch delivery. We show that the problem can be optimally solved in O(n8) time by a dynamic programming algorithm under a reasonable assumption on the relationships among the cost parameters. A computational experiment is also conducted to evaluate the performance of the proposed algorithm. We also show that some special cases of the problem can be optimally solved by lower order algorithms. |
| |
Keywords: | Scheduling Due window assignment Batch delivery |
本文献已被 ScienceDirect 等数据库收录! |
|