In this work, we consider a real-world scheduling problem occurring in the engineering test laboratory of a multinational company producing hydraulic components for motion systems. Similar problems have been solved in the literature under the framework of resource constrained parallel machine scheduling problems. In our work, the tests on the hydraulic components are the jobs to be scheduled. Each job must be processed on a machine and requires an additional human resource to prepare the machine and supervise the job. Machine and workforce eligibility constraints are also included. Release and due dates are given for jobs. The aim is to minimize the total weighted tardiness. Each job has a processing time expressed in working days that depends on the machine and requires a fixed number of hours per day for its assigned worker. Moreover, precedence and contiguity relations between jobs must be respected. We propose a Mixed Integer Linear Programming formulation to model the problem and demonstrate its effectiveness on both real-world and randomly generated instances.

Mixed Integer Linear Programming for a Real-World Parallel Machine Scheduling Problem with Workforce and Precedence Constraints / Caselli, G.; Delorme, M.; Iori, M.; Magni, C. A.. - 8:(2022), pp. 61-71. [10.1007/978-3-030-95380-5_6]

Mixed Integer Linear Programming for a Real-World Parallel Machine Scheduling Problem with Workforce and Precedence Constraints

Magni C. A.
2022

Abstract

In this work, we consider a real-world scheduling problem occurring in the engineering test laboratory of a multinational company producing hydraulic components for motion systems. Similar problems have been solved in the literature under the framework of resource constrained parallel machine scheduling problems. In our work, the tests on the hydraulic components are the jobs to be scheduled. Each job must be processed on a machine and requires an additional human resource to prepare the machine and supervise the job. Machine and workforce eligibility constraints are also included. Release and due dates are given for jobs. The aim is to minimize the total weighted tardiness. Each job has a processing time expressed in working days that depends on the machine and requires a fixed number of hours per day for its assigned worker. Moreover, precedence and contiguity relations between jobs must be respected. We propose a Mixed Integer Linear Programming formulation to model the problem and demonstrate its effectiveness on both real-world and randomly generated instances.
Mixed Integer Linear Programming for a Real-World Parallel Machine Scheduling Problem with Workforce and Precedence Constraints
Mixed Integer Linear Programming for a Real-World Parallel Machine Scheduling Problem with Workforce and Precedence Constraints / Caselli, G.; Delorme, M.; Iori, M.; Magni, C. A.. - 8:(2022), pp. 61-71. [10.1007/978-3-030-95380-5_6]
Caselli, G.; Delorme, M.; Iori, M.; Magni, C. A.
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/1286526
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact