具有周期性维护、作业拒绝和加权完成时间和的并行机器调度问题的禁忌搜索。

IF 1.4 4区 工程技术 Q4 ENGINEERING, MANUFACTURING
Journal of Scheduling Pub Date : 2022-01-01 Epub Date: 2021-10-17 DOI:10.1007/s10951-021-00711-9
Hanane Krim, Nicolas Zufferey, Jean-Yves Potvin, Rachid Benmansour, David Duvivier
{"title":"具有周期性维护、作业拒绝和加权完成时间和的并行机器调度问题的禁忌搜索。","authors":"Hanane Krim,&nbsp;Nicolas Zufferey,&nbsp;Jean-Yves Potvin,&nbsp;Rachid Benmansour,&nbsp;David Duvivier","doi":"10.1007/s10951-021-00711-9","DOIUrl":null,"url":null,"abstract":"<p><p>We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.</p>","PeriodicalId":50061,"journal":{"name":"Journal of Scheduling","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8929393/pdf/","citationCount":"4","resultStr":"{\"title\":\"Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times.\",\"authors\":\"Hanane Krim,&nbsp;Nicolas Zufferey,&nbsp;Jean-Yves Potvin,&nbsp;Rachid Benmansour,&nbsp;David Duvivier\",\"doi\":\"10.1007/s10951-021-00711-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.</p>\",\"PeriodicalId\":50061,\"journal\":{\"name\":\"Journal of Scheduling\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8929393/pdf/\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Scheduling\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://doi.org/10.1007/s10951-021-00711-9\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2021/10/17 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q4\",\"JCRName\":\"ENGINEERING, MANUFACTURING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Scheduling","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1007/s10951-021-00711-9","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2021/10/17 0:00:00","PubModel":"Epub","JCR":"Q4","JCRName":"ENGINEERING, MANUFACTURING","Score":null,"Total":0}
引用次数: 4

摘要

本文研究了具有定期预防性维护策略的两台不同并行机器的双准则调度问题。考虑的两个目标包括最小化工作拒绝成本和加权完成时间总和。由于所考虑的应用程序中的两个目标之间存在自然的层次结构,因此可以通过字典方法处理它们。本文的主要贡献在于:首先,提出了一个与实践相关的新问题;其次,为该问题建立了一个混合整数-线性规划模型;第三,引入了依赖于不同邻域结构和解空间的两种可推广的禁忌搜索元启发式方法。计算结果为120个实例(从一个真实的情况下产生)报告,以经验证明所提出的元启发式的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times.

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times.

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times.

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times.

We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Scheduling
Journal of Scheduling 工程技术-工程:制造
CiteScore
3.80
自引率
10.00%
发文量
49
审稿时长
6-12 weeks
期刊介绍: The Journal of Scheduling provides a recognized global forum for the publication of all forms of scheduling research. First published in June 1998, Journal of Scheduling covers advances in scheduling research, such as the latest techniques, applications, theoretical issues and novel approaches to problems. The journal is of direct relevance to the areas of Computer Science, Discrete Mathematics, Operational Research, Engineering, Management, Artificial Intelligence, Construction, Distribution, Manufacturing, Transport, Aerospace and Retail and Service Industries. These disciplines face complex scheduling needs and all stand to gain from advances in scheduling technology and understanding.
×
引用
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学术官方微信