Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling
Edward G. Coffman Jr.M. R. GareyPublished in: STOC (1991)
Keyphrases
- scheduling problem
- scheduling algorithm
- precedence constraints
- single machine
- unrelated parallel machines
- parallel processors
- parallel machines
- multiprocessor systems
- single processor
- processing times
- flowshop
- completion times
- scheduling jobs
- setup times
- distributed memory
- theorem proving
- response time
- np hard
- parallel processing
- resource allocation
- high speed
- theorem prover
- linear logic
- round robin
- computer architecture
- preventive maintenance
- dynamic scheduling
- single chip
- resource utilization
- job shop
- optimal solution
- tabu search
- special case
- lower bound
- priority queue
- data structure