Single-machine batch delivery scheduling with an assignable common due window

详细信息    查看全文

• 作者：Yunqiang Yin ; T.C.E. Cheng ; Chou-Jung Hsu ; Chin-Chia Wu
• 关键词：Scheduling ; Due window assignment ; Batch delivery
• 刊名：Omega
• 出版年：2013
• 出版时间：April, 2013
• 年：2013
• 卷：41
• 期：2
• 页码：216-225
• 全文大小：339 K

文摘

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 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.