Solution approaches for the parallel machine order acceptance and scheduling problem with sequence-dependent setup times, release dates and deadlines

European J. of Industrial Engineering Pub Date : 2021-04-30 DOI:10.1504/EJIE.2021.115171

P. S. Bicakci, Tusan Derya, Imdat Kara

{"title":"Solution approaches for the parallel machine order acceptance and scheduling problem with sequence-dependent setup times, release dates and deadlines","authors":"P. S. Bicakci, Tusan Derya, Imdat Kara","doi":"10.1504/EJIE.2021.115171","DOIUrl":null,"url":null,"abstract":"Order acceptance and scheduling problem arises when there is limited capacity to process all orders in a make-to-order environment. The paper examines the identical parallel machines order acceptance and scheduling problem with sequence-dependent setup times, release dates and deadlines. The extant literature is deeply researched, and it is concluded that well-designed mathematical formulations are still necessitated in this area. Therefore, a new formulation is proposed for this problem and a recent formulation is chosen from the literature in order to make the comparison. An extensive computational analysis is conducted to test the performance of the formulations. The proposed formulation outperformed the existing one in terms of run times and the number of optimal values. Besides, a variable neighbourhood search-based simulated annealing algorithm is propounded to solve large-sized instances. As a result, it is observed that the heuristic algorithm can solve large-sized instances effectively in a very short span of time. [Received: 18 December 2019; Accepted: 25 April 2020]","PeriodicalId":314867,"journal":{"name":"European J. of Industrial Engineering","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European J. of Industrial Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/EJIE.2021.115171","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

Order acceptance and scheduling problem arises when there is limited capacity to process all orders in a make-to-order environment. The paper examines the identical parallel machines order acceptance and scheduling problem with sequence-dependent setup times, release dates and deadlines. The extant literature is deeply researched, and it is concluded that well-designed mathematical formulations are still necessitated in this area. Therefore, a new formulation is proposed for this problem and a recent formulation is chosen from the literature in order to make the comparison. An extensive computational analysis is conducted to test the performance of the formulations. The proposed formulation outperformed the existing one in terms of run times and the number of optimal values. Besides, a variable neighbourhood search-based simulated annealing algorithm is propounded to solve large-sized instances. As a result, it is observed that the heuristic algorithm can solve large-sized instances effectively in a very short span of time. [Received: 18 December 2019; Accepted: 25 April 2020]

查看原文本刊更多论文

具有顺序相关的安装时间、发布日期和截止日期的并行机订单接受和调度问题的解决方法

当在按订单生产的环境中处理所有订单的能力有限时，就会出现订单接受和调度问题。本文研究了具有序列依赖的安装时间、发布日期和截止日期的相同并行机订单接受和调度问题。通过对现有文献的深入研究，得出了在这一领域仍然需要精心设计的数学公式的结论。因此，本文针对这一问题提出了一个新的公式，并从文献中选择了一个最新的公式进行比较。进行了广泛的计算分析，以测试配方的性能。提出的公式在运行时间和最优值的数量方面优于现有的公式。此外，提出了一种基于变邻域搜索的模拟退火算法来求解大型实例。结果表明，启发式算法可以在很短的时间内有效地求解大型实例。[收稿日期:2019年12月18日;录用日期:2020年4月25日]

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

求助全文

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

来源期刊

European J. of Industrial Engineering

自引率

0.00%

发文量