The complex nature of the capacitated lot-sizing problem, particularly within the scheduling, requires a holistic approach that considers multiple factors and their intricate interactions. In this context, a novel conceptual framework (CF) to support the combined Capacitated Lot-Sizing and Scheduling Problem (CLSSP) through mathematical modelling is proposed. The CF is developed through a rigorous methodology that combines data collection, data analysis, literature review and conceptual framework definition. It is composed by seven dimensions, with different categories, in turn made up of elements related to different aspects of the problem and its modelling. The CF serves a dual purpose: as a comprehensive tool for the structured analysis of existing models facilitating the gaps identification and as a guide for proposing novel mathematical programming models to address the combined complexities of the CLSSP including those not yet covered.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Conceptual Framework for the Optimization of Capacitated Lot-Sizing and Scheduling Problem

  • Juan Pablo Fiesco,
  • Ana Esteso,
  • M. M. E. Alemany,
  • Raúl Poler

摘要

The complex nature of the capacitated lot-sizing problem, particularly within the scheduling, requires a holistic approach that considers multiple factors and their intricate interactions. In this context, a novel conceptual framework (CF) to support the combined Capacitated Lot-Sizing and Scheduling Problem (CLSSP) through mathematical modelling is proposed. The CF is developed through a rigorous methodology that combines data collection, data analysis, literature review and conceptual framework definition. It is composed by seven dimensions, with different categories, in turn made up of elements related to different aspects of the problem and its modelling. The CF serves a dual purpose: as a comprehensive tool for the structured analysis of existing models facilitating the gaps identification and as a guide for proposing novel mathematical programming models to address the combined complexities of the CLSSP including those not yet covered.