Coupled Task Scheduling With Exact Delays: Literature Review and Models

M. Khatami, A. Salehipour, T. Cheng
{"title":"Coupled Task Scheduling With Exact Delays: Literature Review and Models","authors":"M. Khatami, A. Salehipour, T. Cheng","doi":"10.2139/ssrn.3333563","DOIUrl":null,"url":null,"abstract":"Abstract The coupled task scheduling problem concerns scheduling a set of jobs, each with at least two tasks and there is an exact delay period between two consecutive tasks, on a set of machines to optimize a performance criterion. While research on the problem dates back to the 1980s, interests in the computational complexity of variants of the problem and solution methodologies have been evolving in the past few years. This motivates us to present an up-to-date and comprehensive literature review on the topic. Aiming to provide a complete road map for future research on the coupled task scheduling problem, we discuss all the relevant studies and potential research opportunities. In addition, we propose several sets of benchmark instances for the problem in various settings and provide a detailed evaluation of all the available mathematical models with a view to facilitating future research on the solution methods.","PeriodicalId":443021,"journal":{"name":"Engineering Educator: Courses","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Educator: Courses","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3333563","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

Abstract The coupled task scheduling problem concerns scheduling a set of jobs, each with at least two tasks and there is an exact delay period between two consecutive tasks, on a set of machines to optimize a performance criterion. While research on the problem dates back to the 1980s, interests in the computational complexity of variants of the problem and solution methodologies have been evolving in the past few years. This motivates us to present an up-to-date and comprehensive literature review on the topic. Aiming to provide a complete road map for future research on the coupled task scheduling problem, we discuss all the relevant studies and potential research opportunities. In addition, we propose several sets of benchmark instances for the problem in various settings and provide a detailed evaluation of all the available mathematical models with a view to facilitating future research on the solution methods.
具有精确延迟的耦合任务调度:文献综述和模型
耦合任务调度问题是在一组机器上调度一组作业,每个作业至少有两个任务,并且两个连续任务之间存在精确的延迟时间,以优化性能标准。虽然对该问题的研究可以追溯到20世纪80年代,但对该问题变体的计算复杂性和解决方法的兴趣在过去几年中一直在发展。这促使我们提出一个最新的和全面的文献综述的主题。为了给耦合任务调度问题的未来研究提供一个完整的路线图,我们讨论了所有相关的研究和潜在的研究机会。此外,我们提出了几组不同设置下的问题基准实例,并提供了所有可用数学模型的详细评估,以促进未来解决方法的研究。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信