In the aircraft industry structural components, referred to as part numbers (PN), have to be subject to an heat treatment in capacitated burn-in furnaces for a pre-defined period (exposure time) in order to provide them with specific physic and chemical features (e.g. hardness, corrosion resistance, conductivity). Two or more part numbers can be grouped in a batch and treated simultaneously in the same furnace if it is possible to individuate a common exposure time. In order to minimize the total completion time (makespan) of the process it needs to determine the appropriate grouping of the part numbers into batches (batching problem) to be processed by each furnace (scheduling problem). The problem can be modeled as a batch scheduling problem on parallel machines where the batching and the scheduling problem are considered at the same time. Starting from a real case study, we present an original integer linear programming formulation in the case of two capacitated parallel machines and we provide the results obtained on two real instances coming from the aircraft industry.

A MILP formulation for a batch scheduling problem on parallel machines in the aircraft industry / Boccia, M.; Bruno, Giuseppe; Sterle, Claudio. - (2013), pp. 1-6. (Intervento presentato al convegno 5th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2013 tenutosi a Hammamet , Tunisia nel 28-30 April 2013) [10.1109/ICMSAO.2013.6552650].

A MILP formulation for a batch scheduling problem on parallel machines in the aircraft industry

Boccia M.;BRUNO, GIUSEPPE;STERLE, CLAUDIO
2013

Abstract

In the aircraft industry structural components, referred to as part numbers (PN), have to be subject to an heat treatment in capacitated burn-in furnaces for a pre-defined period (exposure time) in order to provide them with specific physic and chemical features (e.g. hardness, corrosion resistance, conductivity). Two or more part numbers can be grouped in a batch and treated simultaneously in the same furnace if it is possible to individuate a common exposure time. In order to minimize the total completion time (makespan) of the process it needs to determine the appropriate grouping of the part numbers into batches (batching problem) to be processed by each furnace (scheduling problem). The problem can be modeled as a batch scheduling problem on parallel machines where the batching and the scheduling problem are considered at the same time. Starting from a real case study, we present an original integer linear programming formulation in the case of two capacitated parallel machines and we provide the results obtained on two real instances coming from the aircraft industry.
2013
A MILP formulation for a batch scheduling problem on parallel machines in the aircraft industry / Boccia, M.; Bruno, Giuseppe; Sterle, Claudio. - (2013), pp. 1-6. (Intervento presentato al convegno 5th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2013 tenutosi a Hammamet , Tunisia nel 28-30 April 2013) [10.1109/ICMSAO.2013.6552650].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

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