A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines

Liu Min, Wu Cheng
{"title":"A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines","authors":"Liu Min,&nbsp;Wu Cheng","doi":"10.1016/S0954-1810(99)00021-7","DOIUrl":null,"url":null,"abstract":"<div><p>Identical parallel machine scheduling problem for minimizing the makespan is a very important production scheduling problem, but there have been many difficulties in the course of solving large scale identical parallel machine scheduling problem with too many jobs and machines. Genetic algorithms have shown great advantages in solving the combinatorial optimization problem in view of its characteristic that has high efficiency and that is fit for practical application. In this article, a kind of genetic algorithm based on machine code for minimizing the makespan in identical machine scheduling problem is presented. Several different scale numerical examples demonstrate the genetic algorithm proposed is efficient and fit for larger scale identical parallel machine scheduling problem for minimizing the makespan, the quality of its solution has advantage over heuristic procedure and simulated annealing method.</p></div>","PeriodicalId":100123,"journal":{"name":"Artificial Intelligence in Engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1999-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0954-1810(99)00021-7","citationCount":"123","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence in Engineering","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0954181099000217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 123

Abstract

Identical parallel machine scheduling problem for minimizing the makespan is a very important production scheduling problem, but there have been many difficulties in the course of solving large scale identical parallel machine scheduling problem with too many jobs and machines. Genetic algorithms have shown great advantages in solving the combinatorial optimization problem in view of its characteristic that has high efficiency and that is fit for practical application. In this article, a kind of genetic algorithm based on machine code for minimizing the makespan in identical machine scheduling problem is presented. Several different scale numerical examples demonstrate the genetic algorithm proposed is efficient and fit for larger scale identical parallel machine scheduling problem for minimizing the makespan, the quality of its solution has advantage over heuristic procedure and simulated annealing method.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在调度相同并行机器的情况下最小化完工时间的遗传算法
以最大完工时间为目标的同行机调度问题是一个非常重要的生产调度问题,但在解决大规模多工多机的同行机调度问题的过程中遇到了很多困难。遗传算法以其效率高、适合实际应用的特点,在解决组合优化问题方面显示出很大的优势。本文提出了一种基于机器码的遗传算法,用于求解同机调度问题中最大完工时间的最小化问题。几个不同规模的数值算例表明,所提出的遗传算法是有效的,适合于求解更大规模的相同并行机最大完工时间调度问题,其解的质量优于启发式方法和模拟退火方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Volume Contents Simulating behaviors of human situation awareness under high workloads Emergent synthesis of motion patterns for locomotion robots Synthesis and emergence — research overview Concept of self-reconfigurable modular robotic system
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1