Scheduling a single machine to minimize a regular objective function under setup constraints.
Philippe BaptisteClaude Le PapePublished in: Discret. Optim. (2005)
Keyphrases
- single machine to minimize
- precedence constraints
- objective function
- scheduling problem
- constrained optimization
- branch and bound algorithm
- global constraints
- number of late jobs
- resource constraints
- total tardiness
- parallel machines
- optimal solution
- release times
- scheduling algorithm
- release dates
- lower bound
- constraint satisfaction
- preemptive scheduling
- single machine scheduling problem
- cost function
- partially ordered
- flowshop
- sequence dependent setup times
- identical machines
- approximation algorithms
- feasible solution
- resource allocation
- optimization problems
- genetic algorithm