期刊
INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL
卷 10, 期 6, 页码 2113-2126出版社
ICIC INTERNATIONAL
关键词
Job shop scheduling; Dynamic scheduling; Multi-objective optimization; Evolutionary algorithm; Mathematical modelling
资金
- Outstanding Young and Middle-Aged University Teachers and Presidents Training Abroad Project in Jiangsu Province, China
- Scientific Research Fund of Nanjing University of Information Science and Technology, China [S8111127001]
Job shop scheduling is a classical combinational optimization problem. Most real-world environments are dynamic and a variety of disruptions may occur unexpectedly, e.g., arrivals of new jobs, machine breakdowns. This paper analyzes the limitations of the static approaches when rescheduling in dynamically changing environments, and the instability problem induced by rescheduling when only based on shop efficiency. Then issues that have appeared in recent years on dynamic job shop scheduling with multiple objectives are described. We categorize the disruptions as data uncertainties and real-time events, and classify the typical objectives in dynamic scheduling into three categories, which are the shop efficiency, schedule robustness and system stability. A new mathematical model of the multi-objective dynamic job shop scheduling problem (MODJSSP) is constructed based on a robust-reactive scheduling approach. A literature review of the state-of-the-art multi-objective dynamic job shop scheduling approaches is provided, and the strength and weakness of different approaches are discussed, and the gaps in current research work are summarized. Experimental studies validate the effectiveness and efficiency of our new mathematical model for MODJSSP.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据