On the reducibility of multicriteria scheduling problems to bicriteria scheduling problems

S. Akande, A. Oluleye, E. Oyetunji
{"title":"On the reducibility of multicriteria scheduling problems to bicriteria scheduling problems","authors":"S. Akande, A. Oluleye, E. Oyetunji","doi":"10.1109/IEOM.2015.7228107","DOIUrl":null,"url":null,"abstract":"The complexity of scheduling problems grows as the number of objectives/criteria increase. While a majority of the multi criteria scheduling problems are known to be NP-Hard; near-optimal solution methods exist for quite a number of single criterion and bicriteria scheduling problems. This has encouraged researchers to explore the possibilities of reducing multi criteria scheduling problems to equivalent bicriteria problems. In this work, we demonstrate through experimentation that multi criteria scheduling problems can indeed be reduced to bicriteria scheduling problems. In order to demonstrate this, the multi criteria scheduling problem of simultaneously minimizing the total completion time, total flow time, total lateness, and number of tardy jobs on a single machine with job release dates was explored. Three existing solution methods were tested on 950 randomly generated problems ranging from 3 to 100 jobs. Experimental results show that the multicriteria problem can be reduced to bicriteria problem and solved to obtain near optimal solution by the existing solution method of the reduced problem. However, the concept is valid if there exists a relationship between the original and its equivalent bicriteria problem.","PeriodicalId":410110,"journal":{"name":"2015 International Conference on Industrial Engineering and Operations Management (IEOM)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Industrial Engineering and Operations Management (IEOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEOM.2015.7228107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The complexity of scheduling problems grows as the number of objectives/criteria increase. While a majority of the multi criteria scheduling problems are known to be NP-Hard; near-optimal solution methods exist for quite a number of single criterion and bicriteria scheduling problems. This has encouraged researchers to explore the possibilities of reducing multi criteria scheduling problems to equivalent bicriteria problems. In this work, we demonstrate through experimentation that multi criteria scheduling problems can indeed be reduced to bicriteria scheduling problems. In order to demonstrate this, the multi criteria scheduling problem of simultaneously minimizing the total completion time, total flow time, total lateness, and number of tardy jobs on a single machine with job release dates was explored. Three existing solution methods were tested on 950 randomly generated problems ranging from 3 to 100 jobs. Experimental results show that the multicriteria problem can be reduced to bicriteria problem and solved to obtain near optimal solution by the existing solution method of the reduced problem. However, the concept is valid if there exists a relationship between the original and its equivalent bicriteria problem.
多准则调度问题到双准则调度问题的可约性
随着目标/标准数量的增加,调度问题的复杂性也在增加。大多数多准则调度问题都是NP-Hard问题;对于相当多的单准则和双准则调度问题,存在着近似最优解方法。这鼓励研究人员探索将多准则调度问题简化为等效双准则问题的可能性。在这项工作中,我们通过实验证明了多准则调度问题确实可以简化为双准则调度问题。为了证明这一点,研究了在具有作业释放日期的单机上同时最小化总完成时间、总流时间、总延迟时间和延迟作业数的多准则调度问题。在950个随机生成的问题上测试了三种现有的解决方法,这些问题从3个到100个不等。实验结果表明,多准则问题可以简化为双准则问题,并利用现有的简化问题求解方法求解得到近最优解。但是,如果原双准则问题与其等价双准则问题之间存在关系,则该概念是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信