Single Machine Scheduling to Minimize Total Weighted Late Work.
A. M. A. HaririChris N. PottsLuk N. Van WassenhovePublished in: INFORMS J. Comput. (1995)
Keyphrases
- minimize total
- single machine scheduling
- single machine scheduling problem
- release dates
- single machine
- branch and bound algorithm
- processing times
- scheduling problem
- precedence constraints
- parallel machines
- total cost
- combinatorial optimization
- resource consumption
- special case
- search procedure
- dynamic programming
- np hard
- hybrid algorithm
- lagrangian relaxation
- resource allocation
- constraint satisfaction problems
- cost function
- objective function