An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times.
Ming LiuChengbin ChuYinfeng XuFeifeng ZhengPublished in: Optim. Lett. (2010)
Keyphrases
- processing times
- optimal solution
- dynamic programming
- open shop
- worst case
- flowshop
- worst case performance ratio
- np hard
- competitive ratio
- cost function
- completion times
- scheduling problem
- preemptive scheduling
- single machine
- genetic algorithm
- memetic algorithm
- hybrid algorithm
- simulated annealing
- parallel machines
- network flow
- search space
- strongly np hard
- computational complexity
- ant colony optimization