Competitive online scheduling of perfectly malleable jobs with setup times.
Jessen T. HavillWeizhen MaoPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- setup times
- scheduling problem
- unrelated parallel machines
- processing times
- weighted tardiness
- parallel machines
- single machine
- sequence dependent setup times
- flowshop
- precedence constraints
- multi item
- identical machines
- lot sizing
- single machine scheduling problem
- total tardiness
- identical parallel machines
- manufacturing cell
- strongly np hard
- competitive ratio
- release dates
- single server
- scheduling algorithm
- scheduling jobs
- lagrangian relaxation
- tabu search
- open shop
- state space
- branch and bound algorithm