基于遗传算法的流水车间和作业车间调度系统

S. Noor, M. K. Khan, I. Hussain, A. Khan, Syed Riaz Akbar, S. W. Shah, Mohammad Babar
{"title":"基于遗传算法的流水车间和作业车间调度系统","authors":"S. Noor, M. K. Khan, I. Hussain, A. Khan, Syed Riaz Akbar, S. W. Shah, Mohammad Babar","doi":"10.25211/JEAS.V28I1.292","DOIUrl":null,"url":null,"abstract":"Operational scheduling of manufacturing industry is of paramount importance for cost-effective and competitive operation for survival in the market. The operational scheduling encompasses a wide range of scheduling models and many attempts have been made to solve them using analytical, heuristic and artificial intelligence based approaches but no robust solution is yet available to tackle the diverse range of scheduling models. Recent trend shows that Genetic Algorithm (GA)-based solutions are popular because of their suitability to the combinatorial nature of the scheduling problem. In this paper, a GA-based scheduling system is presented where a novel combination of recently introduced crossover scheme for job based chromosome representation with Stochastic Universal Selection (SUS), simple mutation of exchange of genes and a heuristic for evaluation of chromosomes is proposed which is easy to code and robust enough to deal with flow shop as well as job shop scheduling problem. The system is validated through case studies from real world scheduling problems.","PeriodicalId":167225,"journal":{"name":"Journal of Engineering and Applied Sciences , University of Engineering and Technology, Peshawar","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"GA-BASED SCHEDULING SYSTEM FOR FLOW SHOP AND JOB SHOP SCHEDULING PROBLEMS\",\"authors\":\"S. Noor, M. K. Khan, I. Hussain, A. Khan, Syed Riaz Akbar, S. W. Shah, Mohammad Babar\",\"doi\":\"10.25211/JEAS.V28I1.292\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Operational scheduling of manufacturing industry is of paramount importance for cost-effective and competitive operation for survival in the market. The operational scheduling encompasses a wide range of scheduling models and many attempts have been made to solve them using analytical, heuristic and artificial intelligence based approaches but no robust solution is yet available to tackle the diverse range of scheduling models. Recent trend shows that Genetic Algorithm (GA)-based solutions are popular because of their suitability to the combinatorial nature of the scheduling problem. In this paper, a GA-based scheduling system is presented where a novel combination of recently introduced crossover scheme for job based chromosome representation with Stochastic Universal Selection (SUS), simple mutation of exchange of genes and a heuristic for evaluation of chromosomes is proposed which is easy to code and robust enough to deal with flow shop as well as job shop scheduling problem. The system is validated through case studies from real world scheduling problems.\",\"PeriodicalId\":167225,\"journal\":{\"name\":\"Journal of Engineering and Applied Sciences , University of Engineering and Technology, Peshawar\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Engineering and Applied Sciences , University of Engineering and Technology, Peshawar\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.25211/JEAS.V28I1.292\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Engineering and Applied Sciences , University of Engineering and Technology, Peshawar","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.25211/JEAS.V28I1.292","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

制造业的作业调度对于企业在市场上的生存具有成本效益和竞争力。作业调度包含了广泛的调度模型,许多人尝试使用分析、启发式和基于人工智能的方法来解决这些问题,但目前还没有一个可靠的解决方案来处理各种调度模型。最近的趋势表明,基于遗传算法(GA)的解决方案因其适合于调度问题的组合性而受到欢迎。本文提出了一种基于遗传算法的调度系统,该系统将最近提出的基于作业的染色体表示交叉方案与随机普遍选择(SUS)、基因交换的简单突变和染色体评估的启发式方法相结合,该方法易于编码且具有足够的鲁棒性,可用于处理流程车间和作业车间调度问题。通过实际调度问题的案例研究,验证了该系统的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
GA-BASED SCHEDULING SYSTEM FOR FLOW SHOP AND JOB SHOP SCHEDULING PROBLEMS
Operational scheduling of manufacturing industry is of paramount importance for cost-effective and competitive operation for survival in the market. The operational scheduling encompasses a wide range of scheduling models and many attempts have been made to solve them using analytical, heuristic and artificial intelligence based approaches but no robust solution is yet available to tackle the diverse range of scheduling models. Recent trend shows that Genetic Algorithm (GA)-based solutions are popular because of their suitability to the combinatorial nature of the scheduling problem. In this paper, a GA-based scheduling system is presented where a novel combination of recently introduced crossover scheme for job based chromosome representation with Stochastic Universal Selection (SUS), simple mutation of exchange of genes and a heuristic for evaluation of chromosomes is proposed which is easy to code and robust enough to deal with flow shop as well as job shop scheduling problem. The system is validated through case studies from real world scheduling problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信