A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems.
Natashia BolandRiley ClementHamish WatererPublished in: INFORMS J. Comput. (2016)
Keyphrases
- single machine scheduling problem
- precedence constraints
- single machine
- completion times
- scheduling problem
- branch and bound algorithm
- processing times
- release times
- approximation algorithms
- combinatorial optimization
- lower bound
- parallel machines
- resource consumption
- search procedure
- lagrangian relaxation
- partial order
- multi objective