The Machine Loading Problem (MLP) refers to the allocation of operative tasks and tools to machines for the production of parts. Since the uncertainty of processing times might affect the quality of the solution, this paper proposes a robust formulation of an MLP, based on the cardinality-constrained approach, to evaluate the optimal solution in the presence of a given number of fluctuations of the actual processing time with respect to the nominal one. The applicability of the model in the practice has been tested on a case study.

A Cardinality-constrained Approach for Robust Machine Loading Problems

LUGARESI, GIOVANNI;Lanzarone, Ettore;Frigerio, Nicla;Matta, Andrea
2017

Abstract

The Machine Loading Problem (MLP) refers to the allocation of operative tasks and tools to machines for the production of parts. Since the uncertainty of processing times might affect the quality of the solution, this paper proposes a robust formulation of an MLP, based on the cardinality-constrained approach, to evaluate the optimal solution in the presence of a given number of fluctuations of the actual processing time with respect to the nominal one. The applicability of the model in the practice has been tested on a case study.
27TH INTERNATIONAL CONFERENCE ON FLEXIBLE AUTOMATION AND INTELLIGENT MANUFACTURING, FAIM2017
File in questo prodotto:
File Dimensione Formato  
A Cardinality-constrained Approach for Robust Machine Loading Problems.pdf

accesso aperto

: Publisher’s version
Dimensione 965.42 kB
Formato Adobe PDF
965.42 kB Adobe PDF Visualizza/Apri

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: http://hdl.handle.net/11311/1053024
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 3
social impact