Depending on the type of processor, the classical problem of scheduling n jobs on a multiprocessor system with m processors has a number of variations. R.S. Chang and R.C.T. Lee (1988) developed two polynomial algorithms to find an optimal schedule under the condition that each processor can only execute a subset of jobs. Such a condition is useful in many areas such as scheduling a set of cannons to fire a set of targets; each cannon can only fire a subset of targets because of the cannon's range and angle. Two polynomial algorithms with less time complexities than Chang and Lee's algorithms are proposed to the same problem.
Scheduling unit-time jobs on processors with different capabilities
Planung von Einheitszeit-Aufgaben fuer Prozessoren unterschiedlicher Leistungsfaehigkeit in einem Multiprozessorsystem
Computers and Operations Research ; 16 , 5 ; 409-417
1989
9 Seiten, 14 Quellen
Article (Journal)
English
Scheduling Equal Processing Time Jobs to Minimize the Weighted Number of Late Jobs
British Library Online Contents | 2006
|Efficiently Scheduling Tape-resident Jobs
British Library Conference Proceedings | 2002
|A Delay Scheduling Algorithm for Short Jobs
British Library Online Contents | 2015
|JOBS SCHEDULING WITH EARLY-TARDY PENALTIES IN MANUFACTURING SYSTEMS
British Library Conference Proceedings | 2004
|IuD Bahn | 1995
|