Thesis supervisor: Máté Hegyháti
Location of studies (in Hungarian): Széchenyi István University Abbreviation of location of studies: SZE
Description of the research topic:
Mixed-integer linear programming is a dominating technique for a wide range of offline scheduling problems. S-graphs were introduced as a graph-theoretical alternative for batch production systems and proved to be efficient for a lot of problem classes. The eS-graph is a recent generalization of the S-graph, that enables the modeling of wider problem classes and modularization.
The task of the PhD candidate is to identify application areas, where eS-graph can be applied efficiently, and to provide problem class specific acceleration techniques both on the algorithmic and implementation level.
Requirements:
• General understanding of the basic principles of discrete mathematics
• Programming background
• Fluent English
Preferred qualities:
• Former experience with any kind of optimization
• Engineering, logistics experience on any relevant fields
• Advanced C++ skills
• Former research on a related topic
Number of students who can be accepted: 1
Deadline for application: 2020-05-31
2024. IV. 17. ODT ülés Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).
Login
