A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs

Research output: Journal article publicationJournal articleAcademic researchpeer-review

9 Citations (Scopus)


Given a set of identical parallel machines and a set of jobs with different due dates and release times, we consider the problem of finding a schedule such that the number of late jobs is minimized, where the given due dates and release times are assumed to be agreeable. A heuristic algorithm is presented and a dynamic programming lower bounding procedure is developed. Computational experiments are performed to show the effectiveness of the heuristic.
Original languageEnglish
Pages (from-to)277-283
Number of pages7
JournalComputers and Operations Research
Issue number3
Publication statusPublished - 1 Jan 1995
Externally publishedYes

ASJC Scopus subject areas

  • Computer Science(all)
  • Management Science and Operations Research
  • Modelling and Simulation
  • Information Systems and Management
  • Applied Mathematics
  • Transportation

Cite this