Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling.

Edward G. Coffman Jr.M. R. Garey

Published in: J. ACM (1993)

Keyphrases

scheduling problem
single machine
scheduling algorithm
precedence constraints
unrelated parallel machines
parallel processors
parallel machines
multiprocessor systems
scheduling jobs

completion times
single processor
high speed
processing times
setup times
np hard
response time
tabu search
job shop

lower bound
parallel processing
resource constraints
theorem prover
instruction set
single machine scheduling problem
distributed memory
flowshop

special case
high end
computer architecture
parallel architecture
linear logic
preventive maintenance
priority queue
computational complexity