Decision diagram-based integer programming for the paired job scheduling problem.
Leonardo LozanoMichael J. MagazineGeorge G. PolakPublished in: IISE Trans. (2021)
Keyphrases
- integer programming
- scheduling problem
- flowshop
- np hard
- processing times
- decision diagrams
- maximum lateness
- single machine
- efficient computation
- column generation
- constraint satisfaction problems
- completion times
- lagrangian relaxation
- np complete
- linear programming
- parallel machines
- multi valued
- constraint programming
- approximation algorithms
- integer program
- markov decision processes
- tabu search
- optimal solution
- cutting plane algorithm
- lower bound
- production planning
- branch and bound algorithm
- cutting plane
- special case
- minimum cost
- single machine scheduling problem
- tardiness cost
- set partitioning
- computational complexity
- compressed data
- planning problems
- linear program
- upper bound
- state space