A Cardinality-constrained Approach for Robust Machine Loading Problems

Giovanni Lugaresi (), Ettore Lanzarone, Nicola Frigerio and Andrea Matta
Additional contact information
Giovanni Lugaresi: LGI - Laboratoire Génie Industriel - CentraleSupélec - Université Paris-Saclay
Ettore Lanzarone: Istituto di Analisi dei Sistemi e Informatica - CNR - Istituto di Analisi dei Sistemi e Informatica - CNR
Andrea Matta: POLIMI - Politecnico di Milano [Milan]

Post-Print from HAL

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.

Keywords: Manufacturing Systems; machine loading problem; robust optimisation; production planning (search for similar items in EconPapers)
Date: 2017-06-27
Note: View the original document on HAL open archive server: https://hal.science/hal-03880625
References: View references in EconPapers View complete reference list from CitEc
Citations:

Published in International Conference on Flexible Automation and Intelligent Manufacturing, FAIM2017, Jun 2017, Modena, Italy. pp.1718 - 1725, ⟨10.1016/j.promfg.2017.07.298⟩

Downloads: (external link)
https://hal.science/hal-03880625/document (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-03880625

DOI: 10.1016/j.promfg.2017.07.298

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().