.png){kind=icon}
Return
Multiobjective single machine scheduling with nontraditional requirements
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2006.06.018.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
multicriteria scheduling
nontraditional requirements
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10
Papers:
8.0K
Citations:
3.6W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveA Randomized Trial Comparing a Brief Meditation Retreat to a Vacation: Effects on Daily Well-Being
PREAI
ShareSaveLow 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
OAAIShareSaveShareSaveShareSave
View more