An examination of job interchange relationships and induction-based proofs in single machine scheduling.
John J. KanetCharles E. WellsPublished in: Ann. Oper. Res. (2017)
Keyphrases
- single machine scheduling
- single machine scheduling problem
- branch and bound algorithm
- processing times
- single machine
- proof search
- combinatorial optimization
- search procedure
- resource consumption
- precedence constraints
- np hard
- lower bound
- database systems
- evolutionary algorithm
- response time
- resource allocation
- genetic algorithm
- lagrangian relaxation