Short-term Production Scheduling in the Soft Drink Industry

Javier Cuzmar Leiva, Víctor M. Albornoz

Abstract

In this study, the formulation of a mixed-integer linear programming model applied to production scheduling in the soft drink industry is addressed. The model considers the production of beverages with different flavors and formats in two synchronized production stages: preparation of syrup in storage tanks and bottling syrup in packaging lines. This model defines the order of the products at each stage of production with makespan minimization, taking into account aspects such as sequence-dependent set-up times, synchronisation between production stages, several tanks and packaging lines, capacity constraints, time constraints (deadlines). Also considered is the property of job splitting in first stage, which reduces waiting times in the packaging lines. We include the method of application in a real-world problem of a beverage bottling company. The results show that on average the application managed to improve 15.67% the company’s current solution.

References

  1. Allahverdi, A., Ng, C., Cheng, T. E., and Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3):985-1032.
  2. Drexl, A. and Kimms, A. (1997). Lot sizing and schedulingsurvey and extensions. European Journal of Operational Research, 99(2):221-235.
  3. Ferreira, D., Clark, A. R., Almada-Lobo, B., and Morabito, R. (2012). Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production. International Journal of Production Economics, 136(2):255-265.
  4. Ferreira, D., Morabito, R., and Rangel, S. (2009). Solution approaches for the soft drink integrated production lot sizing and scheduling problem. European Journal of Operational Research, 196(2):697-706.
  5. Fleischmann, B. and Meyr, H. (1997). The general lotsizing and scheduling problem. Operations-ResearchSpektrum, 19(1):11-21.
  6. Hnaien, F., Yalaoui, F., and Mhadhbi, A. (2015). Makespan minimization on a two-machine flowshop with an availability constraint on the first machine. International Journal of Production Economics, 164:95-104.
  7. Jia, Z.-h., Li, K., and Leung, J. Y.-T. (2015). Effective heuristic for makespan minimization in parallel batch machines with non-identical capacities. International Journal of Production Economics, 169:1-10.
  8. Karmakar, S. and Mahanty, B. (2010). Minimizing makespan for a flexible flow shop scheduling problem in a paint company. Industrial Engineering and Operations Management.
  9. Kurz, M. E. and Askin, R. G. (2004). Scheduling flexible flow lines with sequence-dependent setup times. European Journal of Operational Research, 159(1):66- 82.
  10. Meyr, H. (2000). Simultaneous lotsizing and scheduling by combining local search with dual reoptimization. European Journal of Operational Research, 120(2):311- 326.
  11. Pinedo, M. (2005). Planning and scheduling in manufacturing and services, volume 24. Springer.
  12. Ríos-Mercado, R. Z. and Bard, J. F. (1998). Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. Computers & Operations Research, 25(5):351-366.
  13. Rocha, P. L., Ravetti, M. G., Mateus, G. R., and Pardalos, P. M. (2008). Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Computers & Operations Research, 35(4):1250-1264.
  14. Salomon, M. (1991). Deterministic lotsizing models for production planning, volume 355. Springer.
  15. Seeanner, F. and Meyr, H. (2013). Multi-stage simultaneous lot-sizing and scheduling for flow line production. OR spectrum, 35(1):33-73.
  16. Toledo, C. F. M., Arantes, M. d. S., and Franc¸a, P. M. (2011). Tabu search to solve the synchronized and integrated two-level lot sizing and scheduling problem. In Proceedings of the 13th annual conference on Genetic and evolutionary computation, pages 443-448. ACM.
  17. Toledo, C. F. M., de Oliveira, L., de Freitas Pereira, R., Franc¸a, P. M., and Morabito, R. (2014). A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem. Computers & Operations Research, 48:40-52.
  18. Yilmaz Eroglu, D. and Ozmutlu, H. C. (2014). Mip models and hybrid algorithms for simultaneous job splitting and scheduling on unrelated parallel machines. The Scientific World Journal, 2014.
Download


Paper Citation


in Harvard Style

Leiva J. and Albornoz V. (2016). Short-term Production Scheduling in the Soft Drink Industry . In Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-171-7, pages 416-423. DOI: 10.5220/0005825104160423


in Bibtex Style

@conference{icores16,
author={Javier Cuzmar Leiva and Víctor M. Albornoz},
title={Short-term Production Scheduling in the Soft Drink Industry},
booktitle={Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2016},
pages={416-423},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005825104160423},
isbn={978-989-758-171-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of 5th the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Short-term Production Scheduling in the Soft Drink Industry
SN - 978-989-758-171-7
AU - Leiva J.
AU - Albornoz V.
PY - 2016
SP - 416
EP - 423
DO - 10.5220/0005825104160423