Scheduling two-machine preemptive open shops to minimize total completion time.
Ching-Fang LiawPublished in: Comput. Oper. Res. (2004)
Keyphrases
- minimize total
- single machine
- scheduling problem
- parallel machines
- flowshop
- release dates
- sequence dependent setup times
- weighted tardiness
- processing times
- setup times
- total cost
- precedence constraints
- dynamic programming
- single machine scheduling problem
- scheduling algorithm
- lower bound
- tabu search
- np hard
- objective function
- decision trees
- feature selection