New Multi-product Valid Inequalities for a Discrete Lot-sizing Problem

Céline Gicquel, Michel Minoux

2014

Abstract

We consider a problem arising in the context of industrial production planning, namely the multi-product discrete lot-sizing and scheduling problem with sequence-dependent changeover costs. We aim at developping an exact solution approach based on a standard Branch & Bound procedure for this combinatorial optimization problem. To achieve this, we propose a new family of multi-product valid inequalities which enables us to better take into account in the mixed-integer linear programming formulation the conflicts between different products simultaneously requiring production on the resource. We then present both an exact and a heuristic separation algorithm in order to identify the most violated valid inequalities to be added in the initial MILP formulation within a cutting-plane generation algorithm. We finally discuss preliminary computational results which confirm the practical usefulness of the proposed valid inequalities at strengthening the MILP formulation and at reducing the overall computation time.

References

  1. Belvaux, G. and Wolsey, L. (2001). Modelling practical lot-sizing problems as mixed-integer programs. Management Science, 47(7):993-1007.
  2. Buschkühl, L., Sahling, F., S., H., and Tempelmeier, H. (2010). Dynamic capacitated lot-sizing problems: classification and review of solution approaches. OR Spectrum, 32:231-261.
  3. Ferreira, D., Clark, A., Almada-Lobo, B., and Morabito, R. (2012). Single-stage formulations for synchronized two-stage lot-sizing and scheduling in soft drink production. International Journal of Production Economics, 136:255-265.
  4. Fleischmann, B. (1990). The discrete lot sizing and scheduling problem. European Journal of Operational Research, 44:337-348.
  5. Gicquel, C., Minoux, M., and Dallery, Y. (2009). On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times. Operations Research Letters, 37:32-36.
  6. Jans, R. and Degraeve, Z. (2007). Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. European Journal of Operational Research, 177:1855-1875.
  7. Jans, R. and Degraeve, Z. (2008). Modelling industrial lot sizing problems: a review. Industrial Journal of Production Research, 46(6):1619-1643.
  8. Pochet, Y. and Wolsey, L. (2006). Production planning by mixed integer programming. Springer Science.
  9. Salomon, M., Solomon, M., van Wassenhove, L., Dumas, Y., and Dauzère-Pérès, S. (1997). Solving the discrete lotsizing and scheduling problem with sequence dependant set-up costs and set-up times using the travelling salesman problem with time windows. European Journal of Operational Research, 100:494-513.
  10. Silva, C. and Magalhaes, J. (2006). Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry. Computers & Industrial Engineering, 50:79-89.
  11. van Eijl, C. and van Hoesel, C. (1997). On the discrete lot-sizing and scheduling problem with wagner-whitin costs. Operations Research Letters, 20:7-13.
  12. Wagner, H. and Whitin, T. (1958). Dynamic version of the economic lot size model. Management Science, 51(1):89-96.
Download


Paper Citation


in Harvard Style

Gicquel C. and Minoux M. (2014). New Multi-product Valid Inequalities for a Discrete Lot-sizing Problem . In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 355-362. DOI: 10.5220/0004751703550362


in Bibtex Style

@conference{icores14,
author={Céline Gicquel and Michel Minoux},
title={New Multi-product Valid Inequalities for a Discrete Lot-sizing Problem},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={355-362},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004751703550362},
isbn={978-989-758-017-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - New Multi-product Valid Inequalities for a Discrete Lot-sizing Problem
SN - 978-989-758-017-8
AU - Gicquel C.
AU - Minoux M.
PY - 2014
SP - 355
EP - 362
DO - 10.5220/0004751703550362