A fix-and-optimize heuristic for the Unrelated Parallel Machine Scheduling Problem.
George H. G. FonsecaGuilherme B. FigueiroaTúlio A. M. ToffoloPublished in: Comput. Oper. Res. (2024)
Keyphrases
- parallel machine scheduling problem
- scheduling problem
- release dates
- parallel machines
- total weighted tardiness
- single machine
- sequence dependent setup times
- maximum lateness
- np hard
- flowshop
- tabu search
- job shop
- lagrangian relaxation
- precedence constraints
- heuristic methods
- production scheduling
- single machine scheduling problem
- optimal solution
- job shop scheduling problem
- shortest path
- special case