On the complexity of the single machine scheduling problem minimizing total weighted delay penalty.
Óscar C. VásquezPublished in: Oper. Res. Lett. (2014)
Keyphrases
- completion times
- single machine scheduling problem
- release times
- single machine
- release dates
- branch and bound algorithm
- weighted tardiness
- scheduling problem
- processing times
- weighted sum
- setup times
- worst case
- combinatorial optimization
- search procedure
- precedence constraints
- cost function
- hybrid algorithm
- branch and bound
- shortest path
- lagrangian relaxation
- flowshop
- linear programming
- neural network