Single Machine Scheduling to Minimize Total Late Work.
Chris N. PottsLuk N. Van WassenhovePublished in: Oper. Res. (1992)
Keyphrases
- single machine scheduling
- minimize total
- single machine scheduling problem
- release dates
- single machine
- processing times
- branch and bound algorithm
- scheduling problem
- precedence constraints
- total cost
- parallel machines
- combinatorial optimization
- search procedure
- lower bound
- upper bound
- hybrid algorithm
- cost sensitive
- parallel computing
- misclassification costs
- resource consumption
- graphical models
- dynamic programming