Common due-date assignment and scheduling for a single processor to minimize the number of tardy jobs

Research output: Journal article publicationJournal articleAcademic researchpeer-review

8 Citations (Scopus)


This paper considers the problem of assigning a common due-date to a set of simultaneously available jobs and sequencing them on a single production facility. The objective is to determine the optimal common due-date value and job sequence that jointly minimize a cost function based on the assigned due-date and the number of tardy jobs. It is shown that the optimal due-date coincides with one of the job completion times and ordering jobs in non-decreasing processing times yields an optimal sequence which in general is not unique. An efficient (polynomial-bound) algorithm to find the optimal solution is presented and an illustrative example is provided.
Original languageEnglish
Pages (from-to)129-136
Number of pages8
JournalEngineering Optimization
Issue number2
Publication statusPublished - 1 Aug 1990
Externally publishedYes


  • assignment
  • Due-dates
  • job-shops
  • manufacturing
  • production
  • scheduling

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Optimization
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this