期刊
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
卷 50, 期 7, 页码 1979-2001出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/00207543.2011.561375
关键词
flexible job-shop scheduling; 'AND'/'OR' precedence constraints; heuristic; genetic algorithm; Tabu search
资金
- Korean Ministry of Education, Science and Technology (Institute of Logistics Information Technology)
The purpose of this research is to solve flexible job-shop scheduling problems with 'AND'/'OR' precedence constraints in the operations. We first formulate the problem as a Mixed-Integer Linear Program (MILP). The MILP can be used to compute optimal solutions for small-sized problems. We also developed a heuristic algorithm that can obtain a good solution for the problem regardless of its size. Moreover, we have developed a representation and schedule builder that always produces a legal and feasible solution for the problem, and developed genetic and tabu search algorithms based on the proposed schedule builder. The results of the computational experiments show that the developed meta-heuristics are very effective.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据