Premium
Scheduling to a common due date on parallel uniform processors
Author(s) -
Emmons Hamilton
Publication year - 1987
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(198712)34:6<803::aid-nav3220340605>3.0.co;2-2
Subject(s) - scheduling (production processes) , computer science , parallel computing , job shop scheduling , mathematical optimization , retard , multiprocessor scheduling , due date , processor scheduling , distributed computing , mathematics , flow shop scheduling , schedule , operating system , psychology , psychiatry
We consider scheduling a set of jobs on parallel processors, when all jobs have a common due date and earliness and lateness are penalized at different cost rates. For identical processors, the secondary criteria of minimizing makespan and machine occupancy are addressed. The extension to different, uniform processors is also solved.