Recoverable robust single machine scheduling with polyhedral uncertainty [0.03%]
具有多面体不确定性下的可恢复鲁棒单机调度问题
Matthew Bold,Marc Goerigk
Matthew Bold
This paper considers a recoverable robust single-machine scheduling problem under polyhedral uncertainty with the objective of minimising the total flow time. In this setting, a decision-maker must determine a first-stage schedule subject t...
Modelling and solving the university course timetabling problem with hybrid teaching considerations [0.03%]
混合教学考虑下的大学课程调度问题及其模型求解方法研究
Matthew Davison,Ahmed Kheiri,Konstantinos G Zografos
Matthew Davison
The university course timetabling problem is a challenging problem to solve. As universities have evolved, the features of this problem have changed. One emerging feature is hybrid teaching where classes can be taught online, in-person or a...
A quest for a fair schedule: The International Young Physicists' Tournament [0.03%]
追求公平的赛程：国际青年物理学家锦标赛
Katarína Cechlárová,Ágnes Cseh,Zsuzsanna Jankó et al.
Katarína Cechlárová et al.
The International Young Physicists' Tournament is an established team-oriented scientific competition between high school students from 37 countries on 5 continents. The competition consists of scientific discussions called Fights. Three or...
Ender Özcan,Patrick De Causmaecker,Greet Vanden Berghe
Ender Özcan
Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times [0.03%]
含周期性维护、工件拒绝与完工时间权重和的平行机调度问题的禁忌搜索算法
Hanane Krim,Nicolas Zufferey,Jean-Yves Potvin et al.
Hanane Krim et al.
We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of complet...
Edmund Burke
Edmund Burke
Edmund Burke
Edmund Burke
Alessandro Agnetis,Stanisław Gawiejnowicz,Bertrand Miao-Tsong Lin et al.
Alessandro Agnetis et al.
C. W. Duin; E. Van Der Sluis
C. W. Duin; E. Van Der Sluis