A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes.
Martin BrandaMonika MatouskováPublished in: Comput. Oper. Res. (2024)
Keyphrases
- identical machines
- relaxation algorithm
- scheduling problem
- processing times
- single machine
- job scheduling
- lagrangian relaxation
- relaxation labeling
- flowshop
- np hard
- precedence constraints
- setup times
- scheduling jobs
- regularized least squares
- release dates
- tabu search
- parallel machines
- single machine scheduling problem
- linear programming
- branch and bound algorithm
- constraint satisfaction
- optimal solution
- multi item