A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem.
Matteo AvolioAntonio FuduliPublished in: EURO J. Comput. Optim. (2022)
Keyphrases
- completion times
- single machine scheduling problem
- lagrangian relaxation
- release dates
- release times
- processing times
- branch and bound algorithm
- single machine
- sequence dependent setup times
- shortest processing time
- precedence constraints
- scheduling problem
- weighted sum
- setup times
- integer programming
- search algorithm
- combinatorial optimization
- feasible solution
- dynamic programming
- resource consumption
- branch and bound
- queue length
- column generation
- np hard
- search procedure
- search space
- lower bound
- hybrid algorithm
- optimal solution