A cutting plane approach for the multi-machine precedence-constrained scheduling problem.
Prahalad VenkateshanJoseph G. SzmerekovskyGeorge L. VairaktarakisPublished in: Ann. Oper. Res. (2020)
Keyphrases
- cutting plane
- scheduling problem
- flowshop
- cutting plane algorithm
- minimizing makespan
- single machine
- mixed integer linear programming
- np hard
- parallel machines
- integer programming
- lower bound
- column generation
- setup times
- tabu search
- strongly np hard
- integer program
- mixed integer
- knapsack problem
- upper bound
- valid inequalities
- special case
- exact penalty
- linear program
- cost function
- optimal solution
- evolutionary algorithm
- completion times
- approximation algorithms