期刊
CYBERNETICS AND INFORMATION TECHNOLOGIES
卷 15, 期 2, 页码 3-22出版社
INST INFORMATION & COMMUNICATION TECHNOLOGIES-BULGARIAN ACAD SCIENCES
DOI: 10.1515/cait-2015-0025
关键词
Scheduling problems; flexible job shop; multiple objectives; mathematical models; metaheuristic algorithms
资金
- EU [BG161PO003-1.1.06-0083]
Many real life scheduling problems can be formulated as Flexible Job Shop Scheduling Problems (FJSSPs) which simultaneously optimize several conflicting criteria. A typical feature of such problems is their high computational complexity. The purpose of this paper is to provide a review of the techniques, developed to solve multiple objective FJSSPs during the last decade. These techniques could be classified into two groups: approaches with application of mathematical models and heuristic approaches. Usually hybrid metaheuristic algorithms are proposed for large dimensional real life problems and they outlay the tendency for the future developments of efficient solution approaches for multiple objective FJSSPs.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据