Two-agent single-machine scheduling with assignable due dates

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

Research output: Journal article publicationJournal articleAcademic researchpeer-review

45 Citations (Scopus)


We consider several two-agent scheduling problems with assignable due dates on a single machine, where each of the agents wants to minimize a measure depending on the completion times of its own jobs and the due dates are treated as given variables and must be assigned to individual jobs. The goal is to assign a due date from a given set of due dates and a position in the sequence to each job so that the weighted sum of the objectives of both agents is minimized. For different combinations of the objectives, which include the maximum lateness, total (weighted) tardiness, and total (weighted) number of tardy jobs, we provide the complexity results and solve the corresponding problems, if possible.
Original languageEnglish
Pages (from-to)1674-1685
Number of pages12
JournalApplied Mathematics and Computation
Issue number4
Publication statusPublished - 1 Nov 2012


  • Assignable due dates
  • Scheduling
  • Single machine
  • Two agents

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Two-agent single-machine scheduling with assignable due dates'. Together they form a unique fingerprint.

Cite this