In the present work, we consider a real-world scheduling problem arising in the color printing industry. The problem consists in assigning print jobs to a heterogeneous set of flexographic printer machines, as well as in finding a processing sequence for the sets of jobs assigned to each printer. The aim is to minimize a weighted sum of total weighted tardiness and total setup times. The machines are characterized by a limited sequence of color 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 color group takes a long time, with the effect of significantly raising the setup costs. Furthermore, the time required to clean a color group between two different jobs depends directly on the involved colors. To tackle the problem, we propose a constructive heuristic followed by some local search procedures that are used one after the other in an iterative way. Extensive tests on real-world instances prove that the proposed algorithm can obtain very good-quality solutions within a limited computing time.

Scheduling of Parallel Print Machines with Sequence-Dependent Setup Costs: A Real-World Case Study / Iori, M.; Locatelli, A.; Locatelli, M.. - 631:(2021), pp. 637-645. ((Intervento presentato al convegno IFIP WG 5.7 International Conference on Advances in Production Management Systems, APMS 2021 tenutosi a Nantes nel 2021 [10.1007/978-3-030-85902-2_68].

Scheduling of Parallel Print Machines with Sequence-Dependent Setup Costs: A Real-World Case Study

Iori M.;Locatelli A.
;
Locatelli M.
2021

Abstract

In the present work, we consider a real-world scheduling problem arising in the color printing industry. The problem consists in assigning print jobs to a heterogeneous set of flexographic printer machines, as well as in finding a processing sequence for the sets of jobs assigned to each printer. The aim is to minimize a weighted sum of total weighted tardiness and total setup times. The machines are characterized by a limited sequence of color 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 color group takes a long time, with the effect of significantly raising the setup costs. Furthermore, the time required to clean a color group between two different jobs depends directly on the involved colors. To tackle the problem, we propose a constructive heuristic followed by some local search procedures that are used one after the other in an iterative way. Extensive tests on real-world instances prove that the proposed algorithm can obtain very good-quality solutions within a limited computing time.
31-ago-2021
IFIP WG 5.7 International Conference on Advances in Production Management Systems, APMS 2021
Nantes
2021
631
637
645
Iori, M.; Locatelli, A.; Locatelli, M.
Scheduling of Parallel Print Machines with Sequence-Dependent Setup Costs: A Real-World Case Study / Iori, M.; Locatelli, A.; Locatelli, M.. - 631:(2021), pp. 637-645. ((Intervento presentato al convegno IFIP WG 5.7 International Conference on Advances in Production Management Systems, APMS 2021 tenutosi a Nantes nel 2021 [10.1007/978-3-030-85902-2_68].
File in questo prodotto:
Non ci sono file associati a questo prodotto.
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/1254138
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact