.png){kind=icon}
返回
An uncertain multi-objective programming model for machine scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-016-0522-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper discusses a parallel machine scheduling problem in which the processing times of jobs and the release dates are independent uncertain variables with known uncertainty distributions. An uncertain programming model with multiple objectives is obtained, whose first objective is to minimize the maximum completion time or makespan, and second objective is to minimize the maximum tardiness time. A genetic algorithm is employed to solve the proposed uncertain machine scheduling model, and its efficiency is illustrated by some numerical experiments.
Keyword:
Machine scheduling problem
Uncertain variable
Uncertain programming
Genetic algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
引用论文
分享收藏Wheat Bread Fortification by Grape Pomace Powder: Nutritional, Technological, Antioxidant, and Sensory Properties.png)
Foods
OAAI
FoodsIF0
OAAI分享收藏Molecular systematics and morphological identification of the cryptic species of the genus Acalles Schoenherr, 1825, with descriptions of new species (Coleoptera: Curculionidae: Cryptorhynchinae)Zootaxa
ZootaxaIF0
PREAI
分享收藏Group shops scheduling with makespan criterion subject to random release dates and processing times
PREAI
分享收藏
查看更多内容