.png){kind=icon}
返回
Multiobjective single machine scheduling with nontraditional requirements
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2006.06.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many scheduling problems encountered in practice are must address requirements that are not found in the literature like maximizing the number of jobs that have a particular color. These nontraditional requirements are sometimes an objective as when the desirability of a schedule increases with the number of jobs of the same color that are scheduled consecutively. Other times, the requirements take the form of constraints as in cases where it is forbidden to have more than two consecutive jobs with a particular color. To complicate the situation, most real scheduling problems are multiobjective. This research centers on bicriteria scheduling with nontraditional requirements using an experimental approach and a Random Keys Genetic Algorithm to find Pareto optimal solutions. We address both traditional and nontraditional requirements in a single machine job shop with 20-50 jobs. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
multicriteria scheduling
nontraditional requirements
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.0K
被引数:
3.6W
机构
暂无机构信息
引用论文
A Randomized Trial Comparing a Brief Meditation Retreat to a Vacation: Effects on Daily Well-Being
PREAI
分享收藏Low depth cache-oblivious algorithms.png)
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
OAAI
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architecturesIF0
OAAI分享收藏分享收藏分享收藏
查看更多内容