Error bound for common due date assignment and job scheduling on parallel machines

Jeffrey E. Diamond, Edwin Tai Chiu Cheng

Research output: Journal article publicationJournal articleAcademic researchpeer-review

8 Citations (Scopus)


A heuristic which has been applied to assign a common due to a set of n jobs is considered. An explicit error bound for a variation of the heuristic was obtained. The bound shows that the heuristic is asymptotically optimal for large n if the number of machines m and the weight parameters Pdand PTare held constant. The heuristic is effective if the average number of jobs per machine is reasonably large if the weights assigned to tardiness and the due date are not very different.
Original languageEnglish
Pages (from-to)445-448
Number of pages4
JournalIIE Transactions (Institute of Industrial Engineers)
Issue number5
Publication statusPublished - 1 Jan 2000

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this