Comparative Analysis of Mixed Integer Programming Formulations for Single-Machine and Parallel-Machine Scheduling Problems.
Kuo-Ching YingChen-Yang ChengShih-Wei LinChia-Yang HungPublished in: IEEE Access (2019)
Keyphrases
- comparative analysis
- single machine
- parallel machine scheduling problem
- total weighted tardiness
- scheduling problem
- sequence dependent setup times
- integer programming formulations
- release dates
- maximum lateness
- integer programming
- lagrangian relaxation
- linear program
- processing times
- lower bound
- single machine scheduling problem
- parallel machines
- setup times
- dynamic programming
- production scheduling
- np hard
- job shop scheduling problem
- linear programming
- flowshop
- precedence constraints
- branch and bound algorithm
- upper bound
- job shop scheduling
- simulated annealing
- tabu search
- special case