Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective.
Yuri N. SotskovNatalja G. EgorovaPublished in: Algorithms (2018)
Keyphrases
- single machine scheduling problem
- completion times
- processing times
- release times
- single machine
- release dates
- scheduling problem
- sequence dependent setup times
- earliness tardiness
- setup times
- resource consumption
- total weighted tardiness
- precedence relations
- branch and bound algorithm
- precedence constraints
- scheduling jobs
- number of tardy jobs
- flowshop
- combinatorial optimization
- computational complexity
- objective function
- lagrangian relaxation
- search procedure
- identical machines
- identical parallel machines
- upper bound
- optimal solution