کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1141636 | 957075 | 2013 | 12 صفحه PDF | دانلود رایگان |

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.
► We consider a single-machine common due window assignment and scheduling problem with batch delivery cost.
► We provide some properties of the optimal solution for the proposed problems.
► We present polynomial-time algorithms for the problem.
Journal: Discrete Optimization - Volume 10, Issue 1, February 2013, Pages 42–53