A binary integer linear programming-based approach for solving the allocation problem in multiprocessor partitioned scheduling.
L. Puente-MauryPedro Mejía-AlvarezLuis E. Leyva-del-FoyoPublished in: CCE (2011)
Keyphrases
- integer linear programming
- boolean optimization
- pseudo boolean
- scheduling algorithm
- bicriteria
- column generation
- boolean satisfiability
- linear inequalities
- multiprocessor systems
- global constraints
- scheduling problem
- combinatorial optimization
- integer program
- sat encodings
- cutting plane
- symmetry breaking
- search space
- quadratic programming
- exact solution
- evolutionary algorithm