Solving the Integrated Lot-Sizing and Job-Shop Scheduling Problem

Abstract : Production planning and scheduling are usually performed in a sequential manner, thus generating unfeasibility conflicts.Moreover, solving these problems in complex manufacturing systems (with several products sharing different resources) isvery challenging in production management. This paper addresses the solution of multi-item multi-period multi-resourcesingle-level lot-sizing and scheduling problems in general manufacturing systems with job-shop configurations. The mathematicalformulation is a generalisation of the one used for the Capacitated Lot-Sizing Problem, including detailed capacityconstraints for a fixed sequence of operations. The solution method combines a Lagrangian heuristic, determining a feasibleproduction plan for a fixed sequence of operations,with a sequence improvement method which iteratively feeds the heuristic.Numerical results demonstrate that this approach is efficient and more appropriate than a standard solver for solving complexproblems, regarding solution quality and computational requirements.
Type de document :
Article dans une revue
International Journal of Production Research, Taylor & Francis, 2014, 52 (17), pp.5236-5254
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-01095727
Contributeur : Stéphane Dauzère-Pérès <>
Soumis le : mardi 16 décembre 2014 - 10:30:19
Dernière modification le : mercredi 29 novembre 2017 - 10:07:12

Identifiants

  • HAL Id : emse-01095727, version 1

Collections

Citation

Edwin David Gomez Urrutia, Riad Aggoune, Stéphane Dauzere-Peres. Solving the Integrated Lot-Sizing and Job-Shop Scheduling Problem. International Journal of Production Research, Taylor & Francis, 2014, 52 (17), pp.5236-5254. 〈emse-01095727〉

Partager

Métriques

Consultations de la notice

69