arrow
返回

Iterated greedy algorithms for a complex parallel machine scheduling problem

delete2022-07-01
delete13
delete
OA
AI
D
Davi Mecler *
V
Victor Abu-Marrul
R
Rafael Martinelli
A
Arild Hoff
DOI:10.1016/j.ejor.2021.08.005delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
This paper addresses a complex parallel machine scheduling problem with jobs divided into operations and operations grouped in families. Non-anticipatory family setup times are held at the beginning of each batch, defined by the combination of one setup-time and a sequence of operations from a unique family. Other aspects are also considered in the problem, such as release dates for operations and machines, operation's sizes, and machine's eligibility and capacity. We consider item availability to define the completion times of the operations within the batches, to minimize the total weighted completion time of jobs. We developed Iterated Greedy (IG) algorithms combining destroy and repair operators with a Random Variable Neighborhood Descent (RVND) local search procedure, using four neighborhood structures to solve the problem. The best algorithm variant outperforms the current literature methods for the problem, in terms of average deviation for the best solutions and computational times, in a known benchmark set of 72 instances. New upper bounds are also provided for some instances within this set. Besides, computational experiments are conducted to evaluate the proposed methods' performance in a more challenging set of instances introduced in this work. Two IG variants using a greedy repair operator showed superior performance with more than 70% of the best solutions found uniquely by these variants. Despite the simplicity, the method using the most common destruction and repair operators presented the best results in different evaluated criteria, highlighting its potential and applicability in solving a complex machine scheduling problem. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Metaheuristics
Machine scheduling
Family scheduling
Batching
Setup times
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
8.1W

机构

暂无机构信息
引用论文

引用论文

An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
err2013-07-01
err70
PREAI
errRodriguez, Francisco J.; Lozano, Manuel; Blum, Christian; Garcia-Martinez, Carlos
err分享
err收藏
err分享
err收藏
学者 查看更多内容