Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Effective Heuristics and an Iterated Greedy Algorithm to Schedule Identical Parallel Machines Subject to Common Restrictive Due Windows

Effective Heuristics and an Iterated Greedy Algorithm to Schedule Identical Parallel Machines... In this paper, we address a variant of the identical parallel machines scheduling problem subject to common restrictive due windows. The performance measure adopted is the minimization of total weighted earliness and tardiness. Since the variant under study is an NP-hard problem for two or more machines, we develop a family of constructive heuristics, which are comprised of four phases. First, jobs are sequenced according to priority rules. Second, jobs are assigned to machines using a greedy strategy. Third, a local search is performed to find a better distribution of jobs into machines. Fourth, two heuristics are applied for individually sequencing jobs in each machine, namely RN-RGH and RN-SEA. In addition, we also propose an iterated greedy algorithm to improve the solutions of the best performing heuristic. The computational experiments were carried out to prove the ability of these heuristics to find high-quality solutions in acceptable CPU time. More specifically, the RN-SEA family of algorithms stands out as the most efficient for the problem, however, with a higher computational effort. We also confirm that the IG algorithm has the potential for improving existing solutions, specially for problems with two machines and instances with up to 100 jobs in size. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Arabian Journal for Science and Engineering Springer Journals

Effective Heuristics and an Iterated Greedy Algorithm to Schedule Identical Parallel Machines Subject to Common Restrictive Due Windows

Download PDF
15 pages

Loading next page...
 
/lp/springer-journals/effective-heuristics-and-an-iterated-greedy-algorithm-to-schedule-0h3ADHGxuS

References (38)

Publisher
Springer Journals
Copyright
Copyright © King Fahd University of Petroleum & Minerals 2021
ISSN
1319-8025
eISSN
2191-4281
DOI
10.1007/s13369-021-06244-9
Publisher site
See Article on Publisher Site

Abstract

In this paper, we address a variant of the identical parallel machines scheduling problem subject to common restrictive due windows. The performance measure adopted is the minimization of total weighted earliness and tardiness. Since the variant under study is an NP-hard problem for two or more machines, we develop a family of constructive heuristics, which are comprised of four phases. First, jobs are sequenced according to priority rules. Second, jobs are assigned to machines using a greedy strategy. Third, a local search is performed to find a better distribution of jobs into machines. Fourth, two heuristics are applied for individually sequencing jobs in each machine, namely RN-RGH and RN-SEA. In addition, we also propose an iterated greedy algorithm to improve the solutions of the best performing heuristic. The computational experiments were carried out to prove the ability of these heuristics to find high-quality solutions in acceptable CPU time. More specifically, the RN-SEA family of algorithms stands out as the most efficient for the problem, however, with a higher computational effort. We also confirm that the IG algorithm has the potential for improving existing solutions, specially for problems with two machines and instances with up to 100 jobs in size.

Journal

Arabian Journal for Science and Engineering – Springer Journals

Published: Mar 1, 2022

Keywords: Machine scheduling; Earliness and tardiness; Identical parallel machines; Common due window; Heuristics; Iterated greedy

There are no references for this article.