具有早、迟处罚的并行机器调度的启发式方法

H. Tamaki, T. Komori, S. Abe
{"title":"具有早、迟处罚的并行机器调度的启发式方法","authors":"H. Tamaki, T. Komori, S. Abe","doi":"10.1109/ETFA.1999.813148","DOIUrl":null,"url":null,"abstract":"Identical parallel machine scheduling problems with earliness and tardiness penalties are studied. First, a hybrid method adopting the meta-heuristics and the list scheduling techniques is proposed, where a heuristic procedure MPA (Minimum Penalty increase Assignment) is newly introduced. Then, through several computational experiments, the effectiveness of the proposed method is shown.","PeriodicalId":119106,"journal":{"name":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"A heuristic approach to parallel machine scheduling with earliness and tardiness penalties\",\"authors\":\"H. Tamaki, T. Komori, S. Abe\",\"doi\":\"10.1109/ETFA.1999.813148\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Identical parallel machine scheduling problems with earliness and tardiness penalties are studied. First, a hybrid method adopting the meta-heuristics and the list scheduling techniques is proposed, where a heuristic procedure MPA (Minimum Penalty increase Assignment) is newly introduced. Then, through several computational experiments, the effectiveness of the proposed method is shown.\",\"PeriodicalId\":119106,\"journal\":{\"name\":\"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ETFA.1999.813148\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 7th IEEE International Conference on Emerging Technologies and Factory Automation. Proceedings ETFA '99 (Cat. No.99TH8467)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETFA.1999.813148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

研究了具有提前惩罚和延迟惩罚的同一并行机器调度问题。首先,提出了一种采用元启发式方法和列表调度技术的混合调度方法,其中引入了启发式方法MPA (Minimum Penalty increase Assignment)。然后,通过若干计算实验,验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A heuristic approach to parallel machine scheduling with earliness and tardiness penalties
Identical parallel machine scheduling problems with earliness and tardiness penalties are studied. First, a hybrid method adopting the meta-heuristics and the list scheduling techniques is proposed, where a heuristic procedure MPA (Minimum Penalty increase Assignment) is newly introduced. Then, through several computational experiments, the effectiveness of the proposed method is shown.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Integrated information system for monitoring, scheduling and control applied to batch chemical processes ATM networks for factory communication Linux in factory automation? Internet controlling of fieldbus systems! Comparison between CIMS and CIPS Evolutionary algorithms for adaptive predictive control
×
引用
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