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

1 Citation (Scopus)


We consider a heuristic which has been applied to assign a common due date to a set of n jobs and schedule them on a set of m parallel and identical machines so that the weighted sum of the due date, earliness and tardiness is approximately minimized. We alter the heuristic slightly and show that the revised version is asymptotically optimal as n→∞.
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