- Date
- Friday 7 Feb 2020, 12:00 - 13:00
- Type
- Seminar
- Spoken Language
- English
- Room
- T3-29
- Building
- Mandeville
- Location
- Campus Woudestein
Scheduling problems appear in many interesting domains, including for example manufacturing and satellite scheduling. State-of-the-art solvers can still not solve all realistically-sized problem instances within reasonable time, leaving an open challenge for further research.
Decision diagrams represent the state space by a directed a-cyclic graph, and can be seen as a generalization of dynamic programming. This representation can help to find lower bounds for multi-machine (parallel and uniform) scheduling problems, but also for finding exact solutions for single-machine scheduling with release times, deadlines and rejection. For a significant set of instance classes, these relatively simple algorithms outperform state of the art MILP formulations run with CPLEX.
Registration
For registration please send and email to the Econometric Institute secretarial office at eb-secr@ese.eur.nl. Registration is required for availability of lunch.
Organiser
- More information
Contact: Secretarial office, eb-secr@ese.eur.nl