New ideas in Lagrangian relaxation for a scheduling problem with the weighted tardiness criterion.
Jaroslaw RudyRadoslaw IdzikowskiCzeslaw SmutnickiZbigniew BanaszakGrzegorz BocewiczPublished in: Int. J. Appl. Math. Comput. Sci. (2024)
Keyphrases
- weighted tardiness
- lagrangian relaxation
- setup times
- single machine scheduling problem
- scheduling problem
- sequence dependent setup times
- integer programming
- single machine
- np hard
- feasible solution
- lower bound
- branch and bound algorithm
- column generation
- release dates
- linear programming
- randomly generated test problems
- lower and upper bounds
- dynamic programming
- tabu search
- flowshop
- mixed integer programming
- processing times
- minimize total
- precedence constraints
- shortest path
- parallel machines
- optimal solution
- branch and bound
- np complete
- upper bound
- multi item
- job shop scheduling problem
- linear program