Scheduling unit-length jobs with machine eligibility restrictions.
Chung-Lun LiPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- unit length
- precedence constraints
- parallel machines
- scheduling problem
- flowshop
- identical machines
- unrelated parallel machines
- sequence dependent setup times
- batch processing
- release dates
- strongly np hard
- parallel machine scheduling problem
- branch and bound algorithm
- setup times
- scheduling jobs
- identical parallel machines
- processing times
- precedence relations
- single machine scheduling problem
- maximum lateness
- single machine
- wafer fabrication
- job processing times
- minimizing makespan
- completion times
- approximation algorithms
- job scheduling
- scheduling decisions
- minimize total
- release times
- partially ordered
- tardiness penalties
- preventive maintenance
- list scheduling
- np hard
- shortest processing time
- scheduling strategy
- parallel computing
- scheduling algorithm
- partial order
- special case
- global constraints
- lower bound
- manufacturing cell
- job shop
- lot sizing
- branch and bound
- upper bound