Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed

IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Expert Systems with Applications Pub Date : 2019-04-01 DOI:10.1016/j.eswa.2018.11.007
Jeffrey Schaller , Jorge M.S. Valente
{"title":"Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed","authors":"Jeffrey Schaller ,&nbsp;Jorge M.S. Valente","doi":"10.1016/j.eswa.2018.11.007","DOIUrl":null,"url":null,"abstract":"<div><p>This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimizing total earliness and tardiness. Unforced idle time is considered in order to reduce the earliness of jobs. It is shown how unforced idle time can be inserted on the final machine. Several dispatching heuristics that have been used for the problem without unforced idle time were modified and tested. Several procedures were also developed that conduct a second pass to develop a sequence using dispatching rules. These procedures were also tested and were found to result in better solutions.</p></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"119 ","pages":"Pages 376-386"},"PeriodicalIF":7.5000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.eswa.2018.11.007","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Expert Systems with Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0957417418307279","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 17

Abstract

This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimizing total earliness and tardiness. Unforced idle time is considered in order to reduce the earliness of jobs. It is shown how unforced idle time can be inserted on the final machine. Several dispatching heuristics that have been used for the problem without unforced idle time were modified and tested. Several procedures were also developed that conduct a second pass to develop a sequence using dispatching rules. These procedures were also tested and were found to result in better solutions.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在允许非强迫空闲时间的情况下,排列流车间中调度作业以最小化总提前和延迟的启发式方法
本文以最小化总提前和延迟为目标,研究了排列流车间中的作业调度问题。为了减少工作的提前性,考虑了未强制的空闲时间。它显示了如何在最终机器上插入非强制空闲时间。在没有非强制空闲时间的情况下,对用于该问题的几种调度启发式方法进行了修改和测试。还开发了几个程序,进行第二次通行,以使用调度规则开发序列。还对这些程序进行了测试,发现它们产生了更好的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Expert Systems with Applications
Expert Systems with Applications 工程技术-工程:电子与电气
CiteScore
13.80
自引率
10.60%
发文量
2045
审稿时长
8.7 months
期刊介绍: Expert Systems With Applications is an international journal dedicated to the exchange of information on expert and intelligent systems used globally in industry, government, and universities. The journal emphasizes original papers covering the design, development, testing, implementation, and management of these systems, offering practical guidelines. It spans various sectors such as finance, engineering, marketing, law, project management, information management, medicine, and more. The journal also welcomes papers on multi-agent systems, knowledge management, neural networks, knowledge discovery, data mining, and other related areas, excluding applications to military/defense systems.
期刊最新文献
Gaseous fuel supply chain configuration selection: A life cycle thinking-based decision support framework MTLSER: Multi-task learning enhanced speech emotion recognition with pre-trained acoustic model Impact of cognitive dissonance on social hysteresis: Insights from the expressed and private opinions model A Basic Sequential Variable Neighbourhood Descent and neighbourhood uses for the Beam Angle Optimisation problem Insect identification by combining different neural networks
×
引用
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