A Multi-Machine Scheduling Problem with Global Non Idling Constraint.
Samuel DeleplanqueAlain QuilliotPublished in: MIM (2013)
Keyphrases
- scheduling problem
- flowshop
- minimizing makespan
- minimizing total tardiness
- parallel machines
- tabu search
- special case
- unrelated parallel machines
- processing times
- np hard
- precedence constraints
- single machine
- total tardiness
- preventive maintenance
- search algorithm
- permutation flowshop
- maximum lateness
- strongly np hard
- job shop scheduling problem
- parallel machine scheduling problem
- global constraints
- sequence dependent setup times
- bicriteria
- constraint solving
- constraint networks