Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost

Yunqiang Yin, Edwin Tai Chiu Cheng, Dehua Xu, Chin Chia Wu

Research output: Journal article publicationJournal articleAcademic researchpeer-review

52 Citations (Scopus)


e consider a single-machine batch delivery scheduling and common due date assignment problem. In addition to making decisions on sequencing the jobs, determining the common due date, and scheduling job delivery, we consider the option of performing a rate-modifying activity on the machine. The processing time of a job scheduled after the rate-modifying activity decreases depending on a job-dependent factor. 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 common due date for all the jobs, a location of the rate-modifying activity, and a delivery date for each job to minimize the sum of earliness, tardiness, holding, due date, and delivery cost. We provide some properties of the optimal schedule for the problem and present polynomial algorithms for some special cases.
Original languageEnglish
Pages (from-to)223-234
Number of pages12
JournalComputers and Industrial Engineering
Issue number1
Publication statusPublished - 1 Aug 2012


  • Batch delivery
  • Due date assignment
  • Rate-modifying activity
  • Scheduling

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this