Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity

Yunqiang Yin, Edwin Tai Chiu Cheng, Chin Chia Wu, Shuenn Ren Cheng

Research output: Journal article publicationJournal articleAcademic researchpeer-review

32 Citations (Scopus)


We consider batch delivery scheduling on a single machine, where a common due-date is assigned to all the jobs and a rate-modifying activity on the machine may be scheduled, which can change the processing rate of the machine. Thus the actual processing time of a job is variable depending on whether it is processed before or after the rate-modifying activity. The objective is to determine the optimal job sequence, the optimal partition of the job sequence into batches, the optimal assigned common due-date, and the optimal location of the rate-modifying activity simultaneously to minimize the total cost of earliness, job holding, weighted number of tardy jobs, due-date assignment, and batch delivery. We derive some structural properties of the problem, based on which we design polynomial-time algorithms to solve some special cases of the problem.
Original languageEnglish
Pages (from-to)5583-5596
Number of pages14
JournalInternational Journal of Production Research
Issue number19
Publication statusPublished - 1 Jan 2014


  • batching
  • common due-date assignment
  • rate-modifying activity
  • scheduling

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Management Science and Operations Research
  • Strategy and Management


Dive into the research topics of 'Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity'. Together they form a unique fingerprint.

Cite this