An exact borderline between the NP-hard and polynomial-time solvable cases of flow shop scheduling with job-dependent storage requirements.
Alexander V. KononovMarina PakulichPublished in: J. Comb. Optim. (2024)
Keyphrases
- storage requirements
- np hard
- scheduling problem
- flowshop
- computational complexity
- processing times
- special case
- computational cost
- memory requirements
- np complete
- significantly reduced
- case base
- lower bound
- compression rate
- linear programming
- optimal solution
- frame rate
- minimum cost
- closely related
- high computational complexity
- computer vision
- maximum weight
- remains np hard
- integer programming
- approximation algorithms
- worst case
- case based reasoning
- upper bound
- information systems