Valid inequalities for unrelated parallel machines scheduling with precedence constraints.
Mohammed-Albarra Hassan Abdel-JabbarImed KacemSébastien MartinIzzeldin M. OsmanPublished in: CoDIT (2016)
Keyphrases
- global constraints
- precedence constraints
- unrelated parallel machines
- valid inequalities
- setup times
- integer programming
- scheduling problem
- parallel machines
- release dates
- linear programming
- traveling salesman problem
- np hard
- single machine scheduling problem
- cutting plane
- mixed integer programming
- sequence dependent setup times
- lagrangian relaxation
- feasible solution
- mixed integer
- lp relaxation
- column generation
- lower and upper bounds
- integer program
- tabu search
- primal dual
- identical machines
- multi item
- convex hull
- network flow
- scheduling jobs
- single machine
- branch and bound algorithm
- linear program
- completion times
- continuous variables
- objective function
- parallel computing
- processing times
- upper bound
- special case
- lower bound