A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization.
Levi R. AbreuBruno A. PrataMarcelo Seido NaganoJose M. FramiñanPublished in: Comput. Oper. Res. (2023)
Keyphrases
- greedy algorithm
- constraint programming
- makespan minimization
- processing times
- polynomially solvable
- scheduling problem
- flowshop
- job shop
- total weighted tardiness
- single machine
- constraint satisfaction problems
- completion times
- np complete
- parallel machines
- job shop scheduling problem
- integer programming
- setup times
- global constraints
- release dates
- constraint satisfaction
- np hard
- job shop scheduling
- worst case
- single machine scheduling problem
- special case
- column generation
- dynamic programming
- objective function
- knapsack problem
- arc consistency
- polynomial time approximation
- tabu search
- sequence dependent setup times
- metaheuristic
- precedence constraints
- resource consumption
- minimum cost
- message passing
- approximation algorithms
- multistage