We consider a real-world scheduling problem arising in the colour printing industry. The problem consists in assigning print jobs to a heterogeneous set of flexographic printer machines and finding a processing sequence for the jobs assigned to each machine. The machines are characterised by a limited sequence of colour groups and can equip additional components (e.g. embossing rollers and perforating rolls) to process jobs that require specific treatments. The process to equip a machine with an additional component or to clean a colour group takes a long time, with the effect of significantly raising the setup times. The aim is to minimise a weighted sum of total weighted tardiness and total setup time. The problem derives from the activities of an Italian food packaging company. To solve it, we developed a greedy randomised adaptive search procedure equipped with several local search procedures. The excellent performance of the algorithm is proved by extensive computational experiments on real-world instances, for which it produced good-quality solutions within a limited computing time. The algorithm is currently in use at the company to support their weekly scheduling decisions.

A GRASP for a real-world scheduling problem with unrelated parallel print machines and sequence-dependent setup times / Iori, M.; Locatelli, A.; Locatelli, M.. - In: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. - ISSN 0020-7543. - (2022), pp. 1-19. [10.1080/00207543.2022.2148768]

A GRASP for a real-world scheduling problem with unrelated parallel print machines and sequence-dependent setup times

Iori M.;Locatelli A.
;
Locatelli M.
2022

Abstract

We consider a real-world scheduling problem arising in the colour printing industry. The problem consists in assigning print jobs to a heterogeneous set of flexographic printer machines and finding a processing sequence for the jobs assigned to each machine. The machines are characterised by a limited sequence of colour groups and can equip additional components (e.g. embossing rollers and perforating rolls) to process jobs that require specific treatments. The process to equip a machine with an additional component or to clean a colour group takes a long time, with the effect of significantly raising the setup times. The aim is to minimise a weighted sum of total weighted tardiness and total setup time. The problem derives from the activities of an Italian food packaging company. To solve it, we developed a greedy randomised adaptive search procedure equipped with several local search procedures. The excellent performance of the algorithm is proved by extensive computational experiments on real-world instances, for which it produced good-quality solutions within a limited computing time. The algorithm is currently in use at the company to support their weekly scheduling decisions.
2022
30-nov-2022
1
19
A GRASP for a real-world scheduling problem with unrelated parallel print machines and sequence-dependent setup times / Iori, M.; Locatelli, A.; Locatelli, M.. - In: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH. - ISSN 0020-7543. - (2022), pp. 1-19. [10.1080/00207543.2022.2148768]
Iori, M.; Locatelli, A.; Locatelli, M.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
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/1313887
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 1
social impact