報告題目：Models and algorithms for parallel machine scheduling with conflicts
時間：June 12, 2025, 16:00-17:30
地點：中關(guān)村主樓216
報告人：Roel Leus
報告人簡介：
Roel Leus obtained his Ph.D. in Operations Research (OR) from KU Leuven (Belgium) in 2003, and is currently full professor of OR at the Faculty of Economics and Business of the same university. He is also the program director of the Business Engineering programs (for all campuses, covering around 2000 students), and the chairman of the university-wide Advisory Committee for the Chinese Region of KU Leuven. He was the head of the research group ORSTAT (Operations Research and Statistics) from 2012 to 2016. His main research interests are in sequencing and scheduling, combinatorial optimization, and decision making under uncertainty.
報告內(nèi)容簡介：
We consider an extension of classic parallel machine scheduling where a set of jobs is scheduled on identical parallel machines and an undirected conflict graph is part of the input. Each node in the graph represents a job, and an edge implies that its two jobs are conflicting, meaning that they cannot be scheduled on the same machine. The goal is to find an assignment of the jobs to the machines such that the maximum completion time (makespan) is minimized. We present the results of two research projects on this problem: a first project was published in the Journal of Scheduling in 2017 and finds its inspiration from the existing state of the art for parallel machine scheduling, while the second project was recently completed and published in EJOR (2025), in which we exploit the similarity with graph coloring for developing solution methods.
（承辦：管理工程系、科研與學術(shù)交流中心）
