Thesis supervisor: Máté Hegyháti
co-supervisor: Olivér Ősz
Location of studies (in Hungarian): University of Sopron Abbreviation of location of studies: SOE
Description of the research topic:
Scheduling manufacturing processes has been a prevalent topic in operations research for a long time. Optimizing production efficiency is especially important for high-volume products with stable market demand. These processes require long-term planning and scheduling approaches. A frequently used methodology is called cyclic or periodic scheduling, where a shorter schedule is determined, such that it can be efficiently repeated several times over a longer time horizon.
There are several proposed approaches in the literature for certain problem classes, but it is still an active research area. The applicant’s task is to find ways to improve the performance of existing solution methods, extend them to broader problem classes, or apply optimization techniques that have been used for other problems, to solve cyclic scheduling problems.
Prerequisites:
• Solid background in discrete mathematics
• Fluency in English
Advantages:
• Experience in programming
• Knowledge of MILP modeling
• Experience with evolutionary, genetic algorithms or other metaheuristic optimization methods
Number of students who can be accepted: 1
Deadline for application: 2023-01-10
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
