Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem.
François MargotMaurice QueyranneYaoguang WangPublished in: Oper. Res. (2003)
Keyphrases
- single machine scheduling problem
- network flow
- weighted tardiness
- branch and bound algorithm
- integer programming
- release dates
- processing times
- single machine
- linear programming
- minimum cost
- lagrangian relaxation
- np hard
- optimization model
- search procedure
- combinatorial optimization
- precedence constraints
- hybrid algorithm
- lp relaxation
- image segmentation
- branch and bound
- evolutionary algorithm
- mathematical model
- optimal solution