On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements.
Alexander V. KononovJulia MemarYakov ZinderPublished in: J. Glob. Optim. (2022)
Keyphrases
- flowshop
- storage requirements
- scheduling problem
- np hard
- special case
- processing times
- computational complexity
- lot streaming
- single machine
- maximum lateness
- asymptotic optimality
- setup times
- job shop
- flowshop scheduling
- sequence dependent setup times
- tabu search
- approximation algorithms
- minimizing makespan
- significantly reduced
- linear programming
- job shop scheduling
- memory requirements
- precedence constraints
- strongly np hard
- computational cost
- np complete
- total weighted tardiness
- job shop scheduling problem
- identical parallel machines
- flowshop scheduling problems
- release dates
- completion times
- single machine scheduling problem
- parallel machines
- integer programming
- lower bound
- optimal solution
- minimum cost
- frame rate
- greedy algorithm
- multi objective
- genetic algorithm