Online scheduling of parallel jobs on two machines is 2-competitive.
Johann L. HurinkJacob Jan PaulusPublished in: Oper. Res. Lett. (2008)
Keyphrases
- identical machines
- processing times
- parallel machines
- scheduling problem
- single machine
- job scheduling
- identical parallel machines
- competitive ratio
- flowshop
- scheduling jobs
- setup times
- online learning
- unrelated parallel machines
- precedence constraints
- batch processing machines
- polynomial time approximation
- maximum lateness
- minimize total
- release dates
- weighted tardiness
- np hard
- sequence dependent setup times
- parallel machine scheduling problem
- shared memory
- precedence relations
- e learning