IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-03880625.html
   My bibliography  Save this paper

A Cardinality-constrained Approach for Robust Machine Loading Problems

Author

Listed:
  • 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)

  • Nicola Frigerio
  • Andrea Matta

    (POLIMI - Politecnico di Milano [Milan])

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.

Suggested Citation

  • Giovanni Lugaresi & Ettore Lanzarone & Nicola Frigerio & Andrea Matta, 2017. "A Cardinality-constrained Approach for Robust Machine Loading Problems," Post-Print hal-03880625, HAL.
    • Handle: RePEc:hal:journl:hal-03880625
    DOI: 10.1016/j.promfg.2017.07.298
    Note: View the original document on HAL open archive server: https://hal.science/hal-03880625
    as

    Download full text from publisher

    File URL: https://hal.science/hal-03880625/document
    Download Restriction: no
    File URL: https://libkey.io/10.1016/j.promfg.2017.07.298?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Kathryn E. Stecke, 1983. "Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems," Management Science, INFORMS, vol. 29(3), pages 273-288, March.
    2. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    3. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    4. F. Guerrero & S. Lozano & T. Koltai & J. Larrañeta, 1999. "Machine loading and part type selection in flexible manufacturing systems," International Journal of Production Research, Taylor & Francis Journals, vol. 37(6), pages 1303-1317, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sarhadi, Hassan & Naoum-Sawaya, Joe & Verma, Manish, 2020. "A robust optimization approach to locating and stockpiling marine oil-spill response facilities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    2. Jeong, Jaehee & Premsankar, Gopika & Ghaddar, Bissan & Tarkoma, Sasu, 2024. "A robust optimization approach for placement of applications in edge computing considering latency uncertainty," Omega, Elsevier, vol. 126(C).
    3. Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 143-166, March.
    4. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    5. Lamas, Patricio & Goycoolea, Marcos & Pagnoncelli, Bernardo & Newman, Alexandra, 2024. "A target-time-windows technique for project scheduling under uncertainty," European Journal of Operational Research, Elsevier, vol. 314(2), pages 792-806.
    6. Metzker Soares, Paula & Thevenin, Simon & Adulyasak, Yossiri & Dolgui, Alexandre, 2024. "Adaptive robust optimization for lot-sizing under yield uncertainty," European Journal of Operational Research, Elsevier, vol. 313(2), pages 513-526.
    7. Ashrafi, Hedieh & Thiele, Aurélie C., 2021. "A study of robust portfolio optimization with European options using polyhedral uncertainty sets," Operations Research Perspectives, Elsevier, vol. 8(C).
    8. Viktoryia Buhayenko & Dick den Hertog, 2017. "Adjustable Robust Optimisation approach to optimise discounts for multi-period supply chain coordination under demand uncertainty," International Journal of Production Research, Taylor & Francis Journals, vol. 55(22), pages 6801-6823, November.
    9. Mavrotas, George & Figueira, José Rui & Siskos, Eleftherios, 2015. "Robustness analysis methodology for multi-objective combinatorial optimization problems and application to project selection," Omega, Elsevier, vol. 52(C), pages 142-155.
    10. Cleber D. Rocco & Reinaldo Morabito, 2016. "Robust optimisation approach applied to the analysis of production / logistics and crop planning in the tomato processing industry," International Journal of Production Research, Taylor & Francis Journals, vol. 54(19), pages 5842-5861, October.
    11. Klamroth, Kathrin & Köbis, Elisabeth & Schöbel, Anita & Tammer, Christiane, 2017. "A unified approach to uncertain optimization," European Journal of Operational Research, Elsevier, vol. 260(2), pages 403-420.
    12. Feng, Wei & Feng, Yiping & Zhang, Qi, 2021. "Multistage robust mixed-integer optimization under endogenous uncertainty," European Journal of Operational Research, Elsevier, vol. 294(2), pages 460-475.
    13. Rodrigues, Filipe & Agra, Agostinho, 2022. "Berth allocation and quay crane assignment/scheduling problem under uncertainty: A survey," European Journal of Operational Research, Elsevier, vol. 303(2), pages 501-524.
    14. Pereira, Jordi & Álvarez-Miranda, Eduardo, 2018. "An exact approach for the robust assembly line balancing problem," Omega, Elsevier, vol. 78(C), pages 85-98.
    15. Henao, César Augusto & Ferrer, Juan Carlos & Muñoz, Juan Carlos & Vera, Jorge, 2016. "Multiskilling with closed chains in a service industry: A robust optimization approach," International Journal of Production Economics, Elsevier, vol. 179(C), pages 166-178.
    16. Krumke, Sven O. & Schmidt, Eva & Streicher, Manuel, 2019. "Robust multicovers with budgeted uncertainty," European Journal of Operational Research, Elsevier, vol. 274(3), pages 845-857.
    17. Mohammadi, Reza & He, Qing & Karwan, Mark, 2021. "Data-driven robust strategies for joint optimization of rail renewal and maintenance planning," Omega, Elsevier, vol. 103(C).
    18. An, Kun & Lo, Hong K., 2016. "Two-phase stochastic program for transit network design under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 157-181.
    19. Andreas Thorsen & Tao Yao, 2017. "Robust inventory control under demand and lead time uncertainty," Annals of Operations Research, Springer, vol. 257(1), pages 207-236, October.
    20. Khir, Reem & Erera, Alan & Toriello, Alejandro, 2023. "Robust planning of sorting operations in express delivery systems," European Journal of Operational Research, Elsevier, vol. 306(2), pages 615-631.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-03880625. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.