期刊
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 49, 期 16, 页码 4999-5015出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2010.495088
关键词
evolutionary computation; job shop; job shop scheduling; decision support systems; evolutionary algorithms; scheduling; production planning; combinatorial optimisation; flexible flow shop; neural networks
The job-shop scheduling problem (JSSP) is considered to be one of the most complex combinatorial optimisation problems. In our previous attempt, we hybridised a Genetic Algorithm (GA) with a local search technique to solve JSSPs. In this research, we propose an improved local search technique, Shifted Gap-Reduction (SGR), which improves the performance of GAs when solving relatively difficult test problems. We also modify the new algorithm for JSSPs with machine unavailability and breakdowns. We consider two scenarios of machine unavailability. First, where the unavailability information is available in advance (predictive) and, secondly, where the information is known after a real breakdown (reactive). We show that the revised schedule is mostly able to recover if the interruptions occur during the early stages of the schedules.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据