On time-indexed formulations for the parallel machine scheduling problem with a common server

IF 2.2 3区工程技术 Q2 ENGINEERING, MULTIDISCIPLINARY

Engineering Optimization Pub Date : 2023-10-24 DOI:10.1080/0305215x.2023.2269847

João Marcos Pereira Silva, Anand Subramanian, Eduardo Uchoa

{"title":"On time-indexed formulations for the parallel machine scheduling problem with a common server","authors":"João Marcos Pereira Silva, Anand Subramanian, Eduardo Uchoa","doi":"10.1080/0305215x.2023.2269847","DOIUrl":null,"url":null,"abstract":"AbstractThis article studies the problem of scheduling independent jobs on parallel machines with a common server, the objective of which is to minimize the makespan. In this case, the common server is responsible for performing the setup operations and, therefore, there must be no conflicts while conducting them. Four alternative time-indexed formulations for the problem are considered and evaluated computationally. Moreover, two algorithms are presented that can significantly improve the performance of the best time-indexed formulation. The results obtained on two benchmark datasets involving up to 100 jobs suggest that the proposed improved algorithms are substantially better than existing approaches.Keywords: Schedulingparallel machinescommon servertime-indexed formulationsinteger programming Disclosure statementThe authors declare that they have no conflict of interest.Data availability statementThe authors confirm that the data supporting the findings of this study are available within the article.Additional informationFundingThis research was partially supported by Comissão de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) [Grant Finance Code 001]; Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) [Grants 428549/2016-0, 307843/2018-1 and 313601/2018-6]; Fundação de Amparo à Pesquisa do Estado do Rio de Janeiro (Faperj) [Grant E-26/202.887/2017]; [CAPES PrInt UFF No 88881].","PeriodicalId":50521,"journal":{"name":"Engineering Optimization","volume":"70 1","pages":"0"},"PeriodicalIF":2.2000,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/0305215x.2023.2269847","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}

引用次数: 0

Abstract

AbstractThis article studies the problem of scheduling independent jobs on parallel machines with a common server, the objective of which is to minimize the makespan. In this case, the common server is responsible for performing the setup operations and, therefore, there must be no conflicts while conducting them. Four alternative time-indexed formulations for the problem are considered and evaluated computationally. Moreover, two algorithms are presented that can significantly improve the performance of the best time-indexed formulation. The results obtained on two benchmark datasets involving up to 100 jobs suggest that the proposed improved algorithms are substantially better than existing approaches.Keywords: Schedulingparallel machinescommon servertime-indexed formulationsinteger programming Disclosure statementThe authors declare that they have no conflict of interest.Data availability statementThe authors confirm that the data supporting the findings of this study are available within the article.Additional informationFundingThis research was partially supported by Comissão de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) [Grant Finance Code 001]; Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) [Grants 428549/2016-0, 307843/2018-1 and 313601/2018-6]; Fundação de Amparo à Pesquisa do Estado do Rio de Janeiro (Faperj) [Grant E-26/202.887/2017]; [CAPES PrInt UFF No 88881].

查看原文本刊更多论文

具有公共服务器的并行机器调度问题的时间索引公式

摘要本文研究了具有公共服务器的并行机上独立作业的调度问题，其目标是最小化完工时间。在这种情况下，公共服务器负责执行设置操作，因此，在执行这些操作时必须没有冲突。对该问题的四种备选时间索引公式进行了考虑和计算评估。此外，提出了两种算法，可以显著提高最佳时间索引公式的性能。在涉及多达100个作业的两个基准数据集上获得的结果表明，所提出的改进算法比现有方法要好得多。关键词:调度并行机通用服务器时间索引公式整数编程公开声明作者声明他们没有利益冲突。数据可用性声明作者确认在文章中可以获得支持本研究结果的数据。本研究的部分资金由高级财务管理委员会Nível (CAPES)[资助财务法001]提供支持;国家环境保护研究中心Científico e Tecnológico (CNPq)[拨款428549/2016- 0,307843 /2018-1和313601/2018-6];巴西里约热内卢州政府基金(Faperj) [Grant E-26/202.887/2017];[CAPES PrInt UFF No 88881]。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Engineering Optimization 管理科学-工程：综合

CiteScore

5.90

自引率

7.40%

发文量

审稿时长

3.5 months

期刊介绍： Engineering Optimization is an interdisciplinary engineering journal which serves the large technical community concerned with quantitative computational methods of optimization, and their application to engineering planning, design, manufacture and operational processes. The policy of the journal treats optimization as any formalized numerical process for improvement. Algorithms for numerical optimization are therefore mainstream for the journal, but equally welcome are papers which use the methods of operations research, decision support, statistical decision theory, systems theory, logical inference, knowledge-based systems, artificial intelligence, information theory and processing, and all methods which can be used in the quantitative modelling of the decision-making process. Innovation in optimization is an essential attribute of all papers but engineering applicability is equally vital. Engineering Optimization aims to cover all disciplines within the engineering community though its main focus is in the areas of environmental, civil, mechanical, aerospace and manufacturing engineering. Papers on both research aspects and practical industrial implementations are welcomed.