On the complexity of proportionate open shop and job shop problems.
Abdennour AzerineMourad BoudharDjamal RebainePublished in: Optim. Lett. (2024)
Keyphrases
- open shop
- job shop
- job shop scheduling
- scheduling problem
- approximation algorithms
- resource constrained
- production scheduling
- job shop scheduling problem
- tabu search
- worst case
- benchmark problems
- resource constraints
- computational complexity
- combinatorial optimization problems
- memetic algorithm
- sensor networks
- flowshop
- multistage
- np hard
- ant colony algorithm
- genetic algorithm
- special case
- optimization problems
- objective function