A MILP formulation for a tire curing scheduling problem.
Héctor CancelaPedro PiñeyroJoaquín VelázquezPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- scheduling problem
- mixed integer linear programming
- mixed integer linear
- branch and bound algorithm
- single machine
- np hard
- mathematical programming
- linear program
- tabu search
- flowshop
- precedence constraints
- total tardiness
- cutting plane
- setup times
- mixed integer
- minimizing makespan
- processing times
- permutation flowshop
- production planning
- parallel machines
- strongly np hard
- neural network
- special case
- optimal solution
- unrelated parallel machines
- genetic algorithm