This paper presents a new heuristic for solving the flowshop scheduling problemthat aims to minimize makespan and maximize tardiness. The algorithm is ableto take into account the aforementioned performance measures, finding a set ofnon-dominated solutions representing the Pareto front. This method is based onthe integration of two different techniques: a multi-criteria decision-makingmethod and a constructive heuristic procedure developed for makespanminimization in flowshop scheduling problems. In particular, the technique fororder preference by similarity of ideal solution (TOPSIS) algorithm is integratedwith the Nawaz–Enscore–Ham (NEH) heuristic to generate a set of potentialscheduling solutions. To assess the proposed heuristic’s performance, comparisonwith the best performing multi-objective genetic local search (MOGLS) algorithmproposed in literature is carried out. The test is executed on a large number ofrandom problems characterized by different numbers of machines and jobs.The results show that the new heuristic frequently exceeds the MOGLS results interms of both non-dominated solutions, set quality and computational time.In particular, the improvement becomes more and more significant as the numberof jobs in the problem increases.

A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness / M., Braglia; Grassi, Andrea. - In: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. - ISSN 0020-7543. - STAMPA. - 47:1(2009), pp. 273-288. [10.1080/00207540701500486]

A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness

GRASSI, Andrea
2009-01-01

Abstract

This paper presents a new heuristic for solving the flowshop scheduling problemthat aims to minimize makespan and maximize tardiness. The algorithm is ableto take into account the aforementioned performance measures, finding a set ofnon-dominated solutions representing the Pareto front. This method is based onthe integration of two different techniques: a multi-criteria decision-makingmethod and a constructive heuristic procedure developed for makespanminimization in flowshop scheduling problems. In particular, the technique fororder preference by similarity of ideal solution (TOPSIS) algorithm is integratedwith the Nawaz–Enscore–Ham (NEH) heuristic to generate a set of potentialscheduling solutions. To assess the proposed heuristic’s performance, comparisonwith the best performing multi-objective genetic local search (MOGLS) algorithmproposed in literature is carried out. The test is executed on a large number ofrandom problems characterized by different numbers of machines and jobs.The results show that the new heuristic frequently exceeds the MOGLS results interms of both non-dominated solutions, set quality and computational time.In particular, the improvement becomes more and more significant as the numberof jobs in the problem increases.
47
1
273
288
A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness / M., Braglia; Grassi, Andrea. - In: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. - ISSN 0020-7543. - STAMPA. - 47:1(2009), pp. 273-288. [10.1080/00207540701500486]
M., Braglia; Grassi, Andrea
File in questo prodotto:
File Dimensione Formato  
NEH_Topsis.pdf

non disponibili

Tipologia: Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione 166.68 kB
Formato Adobe PDF
166.68 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/453534
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 10
social impact