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:
The S-graph framework is a graph-theoretic approach for solving scheduling problems, originally designed specifically for batch chemical processes. Over the years, the theoretical techniques proved to be efficient for many problem classes, compared to other approaches in the field, despite their proof-of-concept level of implementation. There is a huge potential to achieve accelerations of magnitudes by combining the theoretical results and modern programming techniques.
The job of the candidate is twofold. First, an efficient implementation of the formerly published algorithms is required. Then, the candidate must investigate and exploit the adherent acceleration possibilities to further enhance the efficiency of the developed solver. These techniques will require both algorithmic and implementation level decisions.
Requirements:
• Advanced C++ skills
• General understanding of the basic principles of discrete mathematics
• Fluent English
Preferred qualities:
• Former experience with any kind of optimization
• Former research on a related topic
• Any experience with heuristic evolutionary methods
• Former experience in code optimization
• Experience in parallel, distributed computation techniques
Deadline for application: 2019-04-30
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
