Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives.
Shesh Narayan SahuYuvraj GajpalSwapan DebbarmaPublished in: Ann. Oper. Res. (2018)
Keyphrases
- minimize total
- single machine
- release dates
- deteriorating jobs
- precedence constraints
- processing times
- scheduling problem
- single machine scheduling problem
- completion times
- maximum lateness
- parallel machines
- branch and bound algorithm
- sequence dependent setup times
- flowshop
- setup times
- approximation algorithms
- partially ordered
- np hard
- global constraints
- special case
- resource consumption
- partial order
- dynamic programming
- combinatorial optimization