Single-machine common due window assignment and scheduling to minimize the total cost

Yunqiang Yin, Edwin Tai Chiu Cheng, Jiayin Wang, Chin Chia Wu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

17 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)42-53
Number of pages12
JournalDiscrete Optimization
Issue number1
Publication statusPublished - 1 Feb 2013


  • Batch delivery
  • Due window assignment
  • Scheduling

ASJC Scopus subject areas

  • Applied Mathematics
  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'Single-machine common due window assignment and scheduling to minimize the total cost'. Together they form a unique fingerprint.

Cite this