A genetic algorithm for general machine scheduling problems

Kyung Mi Lee, T. Yamakawa, Keon-Myung Lee
{"title":"A genetic algorithm for general machine scheduling problems","authors":"Kyung Mi Lee, T. Yamakawa, Keon-Myung Lee","doi":"10.1109/KES.1998.725893","DOIUrl":null,"url":null,"abstract":"This paper deals with the so-called general machine scheduling problems. In the general machine scheduling problems, job shop type jobs and open shop type jobs are scheduled together and the imposition of precedence constraints is allowed between operations belonging to either the same job or different jobs. This paper proposes a genetic algorithm to solve such general machine scheduling problems. Some experimental results are presented to show the applicability of the proposed method. The method can be used to solve traditional job shop scheduling, flow shop scheduling, and open shop scheduling as well as general machine scheduling problems.","PeriodicalId":394492,"journal":{"name":"1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"117","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KES.1998.725893","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 117

Abstract

This paper deals with the so-called general machine scheduling problems. In the general machine scheduling problems, job shop type jobs and open shop type jobs are scheduled together and the imposition of precedence constraints is allowed between operations belonging to either the same job or different jobs. This paper proposes a genetic algorithm to solve such general machine scheduling problems. Some experimental results are presented to show the applicability of the proposed method. The method can be used to solve traditional job shop scheduling, flow shop scheduling, and open shop scheduling as well as general machine scheduling problems.
通用机器调度问题的遗传算法
本文研究所谓的一般机器调度问题。在一般的机器调度问题中,作业车间类型的作业和开放式车间类型的作业被一起调度,并且允许在属于同一作业或不同作业的操作之间施加优先约束。本文提出了一种遗传算法来解决这类通用的机器调度问题。实验结果表明了该方法的适用性。该方法可用于解决传统的作业车间调度、流水车间调度和开车间调度以及一般的机器调度问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信