.png){kind=icon}
返回
Solving multi-objective production scheduling problems using metaheuristics
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2003.08.029.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Most of research in production scheduling is concerned with the optimization of a single criterion. However the analysis of the performance of a schedule often involves more than one aspect and therefore requires a multi-objective treatment. In this paper we first present (Section 1) the general context of multi-objective production scheduling, analyze briefly the different possible approaches and define the aim of this study i.e. to design a general method able to approximate the set of all the efficient schedules for a large set of scheduling models. Then we introduce (Section 2) the models we want to treat-one machine, parallel machines and permutation flow shops-and the corresponding notations. The method used-called multi-objective simulated annealing-is described in Section 3. Section 4 is devoted to extensive numerical experiments and their analysis. Conclusions and further directions of research are discussed in the last section. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
production scheduling
multi-objective optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Floquet Majorana Fermions for Topological Qubits in Superconducting Devices and Cold-Atom Systems
OAAI
.png){kind=icon}
OAAI分享收藏
分享收藏
查看更多内容