讲座题目：An efficient branch-and-price algorithm to solve parallel machine scheduling
主 讲 人：法国艾菲尔大学 储诚斌 教授
讲座时间：2024年6月3日（周一）10：30
讲座地点：商学院江湾楼368
主办单位：米乐(中国)
主 持 人：米乐(中国) 周艳菊 教授
摘 要：
We consider unrelated parallel machine scheduling involving machine usage costs, in addition to classic job completion time-related costs. The usage cost of each machine is made up of a fixed cost and a variable cost proportional to the total processing time of the jobs assigned to it. These features model many practical situations where machine usage costs include, for example, rental fees when the machines are not owned but rented. To tackle this problem, four mathematical models based on the Shortest Weighted Processing Time rule are introduced. Additionally, the problem is formulated into a set-partitioning model, for which a branch-and-price algorithm is proposed with an appropriate branching strategy. Extensive numerical experiments demonstrate the superior performance of the proposed branch-and-price algorithm. Moreover, statistical analyses reveal that the proposed polynomial-time heuristic significantly reduces the computation time, and the mathematical model based on the contribution of every job to the total weighted completion time exhibits the best overall performance.
主讲人简介:
储诚斌，法国艾菲尔大学、福州大学教授，中国教育部2004年度“长江学者”讲座教授，国家级人才，长期致力于生产和物流系统的优化，包括采购管理、可靠性分析与配置、系统维护策略优化、交通运输、切材等领域的研究，迄今为止，他已发表专著3部，200多篇文章被国际期刊发表或接收。他承担过20多项由欧盟、法国中央和地方政府或企业资助的研究项目，他的研究成果在数十家各种规模和不同行业的企业得到应用，并创造巨大经济和社会效益。由于他在理论创新及实际应用方面的突出贡献，他早在1996年就荣获法国运筹学和辅助决策领域的最高奖项Robert Faure一等奖。
