Single-machine common due window assignment and scheduling to minimize the total cost |
| |
| Authors: | Yunqiang Yin T.C.E. Cheng Jiayin Wang Chin-Chia Wu |
| |
| Affiliation: | 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. School of Mathematical Sciences, Beijing Normal University, Beijing 100875, China;5. Department of Statistics, Feng Chia University, Taichung, Taiwan |
| |
| Abstract: | In this paper we consider a single-machine common due window assignment and scheduling problem with batch delivery cost. The starting time and size of the due window are decision variables. Finished jobs are delivered in batches. 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 a job sequence, a delivery date for each job, and a starting time and a size for the due window that jointly minimize the total cost comprising earliness, weighted number of tardy jobs, job holding, due window starting time and size, and batch delivery. We provide some properties of the optimal solution and present polynomial-time algorithms for the problem. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
