Skip to main content

Advertisement

SpringerLink
Log in

Simultaneous lot sizing and scheduling in the animal feed premix industry

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

Feed represents a significant contributor to the total costs of animal production. Improved efficiency of animal food production may reduce feed cost and gain a positive impact on supply as well as the demand in animal food production. In this paper a discrete-time MILP-based scheduling model is proposed for optimization of animal food premix production process. The objective of the model is to minimize the total production and manpower costs while maximizing the utilization of parallel equipment units at the same time. The set of constraints captures all operational constraints from a specific production plant. Testing on a real case study proves the superiority of proposed approach in comparison to the current practice and paves the way for its industrial implementation. A framework for industrial application of the proposed model is described. In terms of capabilities, the proposed tailor-made solution represents a superior alternative to the general purpose software currently available on the market.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Ahmadi-Javid A, Hooshangi-Tabrizi P (2017) Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm. Comput Oper Res 84:73–91

    Article  Google Scholar 

  • Artigues C, Gendreau M, Rousseau L, Vergnaud A (2009) Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound. Comput Oper Res 36:2330–2340

    Article  Google Scholar 

  • Avitech Health (2006) Manufacturing a quality Premix. https://www.thepoultrysite.com/articles/manufacturing-a-quality-premix. Accessed 13 Dec 2021

  • Basán NP, Cóccola ME, García del Valle A, Méndez CA (2019) An efficient MILP-based decomposition strategy for solving large-scale scheduling problems in the shipbuilding industry. Optim Eng 20(4):1085–1115

  • Berber R, Mehmet Y, Zafer O (2007) Automatic generation of production scheduling models in single stage multi-product batch plants: some examples. Math Comput Model 46(1):69–79

  • Carvalho DM, Nascimento MCV (2022) Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup. Eur J Oper Res 296(1):158–173

    Article  Google Scholar 

  • Copil K, Worbelauer M, Meyr H, Tempelmeier H (2016) Simultaneous lot-sizing and scheduling problems: a classification and review of models. Or Spectr 39:1–64

    Article  Google Scholar 

  • Daniels R, Mazzola J, Shi D (2004) Flow shop scheduling with partial resource flexibility. Manag Sci 50:658–669

    Article  Google Scholar 

  • Daniels R, Mazzola J (1994) Flow shop scheduling with resource flexibility. Oper Res 42:504–522

    Article  Google Scholar 

  • Doganis P, Sarimveis H (2007) Optimal scheduling in a yogurt production line based on mixed-integer linear programming. J Food Eng 80(2):445–453

    Article  Google Scholar 

  • Drexl A, Kimms A (1997) Lot sizing and scheduling—survey and extensions. Eur J Oper Res 99:221–235

    Article  Google Scholar 

  • Elekidis AP, Corominas FG, Georgiadis MC (2019) Production scheduling of consumer goods industries. Ind Eng Chem Res 58(51):23261–23275

  • Escobet T, Puig V, Quevedo J, Palá-Schönwälder P, Romera J, Adelman W (2019) Optimal batch scheduling of a multiproduct dairy process using a combined optimization/constraint programming approach. Comput Chem Eng 124:228–237

  • Fang K, Wang S, Pinedo ML, Chen L, Chu F (2021) A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions. Eur J Oper Res 291(1):128–146

    Article  Google Scholar 

  • Ferreira D, Morabito R, Rangel S (2009) Solution approaches for the soft drink integrated production lot sizing and scheduling problem. Eur J Oper Res 196:697–706

    Article  Google Scholar 

  • Ferreira D, Morabito R, Rangel S (2010) Relax and fix heuristics to solve one-stage one machine lot-scheduling models for small-scale soft drink plants. Comput Oper Res 37:684–691

    Article  Google Scholar 

  • Floudas CA, Lin X (2004) Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review. Comput Chem Eng 28:2109–2129

    Article  Google Scholar 

  • Fourer R, Gay DM, Kernighan BW (2003) AMPL: a modeling language for mathematical programming, 2nd edn. Brooks/Cole, Pacific Grove

    Google Scholar 

  • de Armas J, Laguna M (2019) Parallel machine, capacitated lot sizing and scheduling for the pipe-insulation industry. Int J Prod Res. https://doi.org/10.1080/00207543.2019.1600763

    Article  Google Scholar 

  • Guyon O, Lemaire P, Pinson E, Rivreau D (2014) Solving an integrated job-shop problem with human resource constraints. Ann Oper Res 23:147–171

    Article  Google Scholar 

  • Guzman E, Andres B, Poler R (2021) Models and algorithms for production planning, scheduling and sequencing problems: a holistic framework and a systematic review. J Ind Inf Integr. ISSN 2452-414X. https://doi.org/10.1016/j.jii.2021.100287

  • Georgiadis GP, Elekidis AP, Georgiadis MC (2019) Optimization-based scheduling for the process industries: from theory to real-life industrial applications. Processes 7(438):1–35

    Google Scholar 

  • Guimares L, Klabjan D, Almada-Lobo B (2014) Modelling lot-sizing and scheduling problems with sequence dependent setups. Eur J Oper Res 239:644–662

    Article  Google Scholar 

  • Guner Goren H, Tunali S, Jans R (2010) A review of applications of genetic algorithms in lot sizing. J Intell Manuf 21:575–590

    Article  Google Scholar 

  • Heydar M, Mardaneh E, Loxton R (2021) Approximate dynamic programming for an energy-efficient parallel machine scheduling problem. Eur J Oper Res. ISSN 0377-2217. https://doi.org/10.1016/j.ejor.2021.12.041

  • IBM Corporation (2019) Branch and cut in CPLEX. https://www.ibm.com/docs/en/icos/12.10.0?topic=concepts-branch-cut-in-cplex. Accessed 18 Sept 2022

  • Kabra S, Shaik MA, Rathore AS (2013) Multi-period scheduling of a multi-stage multi-product bio-pharmaceutical process. Comput Chem Eng 57:95–103

    Article  Google Scholar 

  • Keha AB, Khowala K, Fowler JW (2009) Mixed integer programming formulations for single machine scheduling problems. Comput Ind Eng 56(1):357–367

  • Koch C, Arbaoui T, Ouazene Y, Yalaoui F, De Brunier H, Jaunet N, De Wulf A (2022) A matheuristic approach for solving a simultaneous lot sizing and scheduling problem with client prioritization in tire industry. Comput Ind Eng 165:1–15

    Article  Google Scholar 

  • Kopanos GM, Puigjaner L (2019) Solving large-scale production scheduling and planning in the process industries. Springer Nature Switzerland AG

    Book  Google Scholar 

  • Kopanos GM, Méndez CA, Puigjaner L (2010) MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry. Eur J Oper Res 207(2):644–655

  • Kopanos GM, Puigjaner L, Maravelias CT (2011) Production planning and scheduling of parallel continuous processes with product families. Ind Eng Chem Res 50(3):1369–1378

  • Marinelli F, Nenni ME, Sforza A (2007) Capacitated lot sizing and scheduling with parallel machines and shared buffers: a case study in a packaging company. Ann Oper Res 150:177–192

  • Martinez MA, Newman AM (2011) A solution approach for optimizing long- and short-term production scheduling at LKAB’s Kiruna mine. Eur J Oper Res 211(1):184–197

    Article  Google Scholar 

  • Martinez KYP, Morabito R, Toso EAV (2018) A coupled process configuration, lot-sizing and scheduling model for production planning in the molded pulp industry. Int J Prod Econ 204:227–243

    Article  Google Scholar 

  • Mendez CA, Cerda J, Grossmann IE, Harjunkoski I, Fahl M (2006) Review: State-of-the-art of optimization methods for short-term scheduling of batch processes. Comput Chem Eng 30:913–946

    Article  Google Scholar 

  • Mordor Intelligence LLP (2016) Feed Premix market—growth, trends and forecast (2020–2025). Mordor Intelligence

    Google Scholar 

  • Pinto JM, Grossmann IE (1995) A continuous time mixed integer linear programming model for short term scheduling of multistage batch plants. Ind Eng Chem Res 34(9):3037–3051

  • Ríos-Solís YA, Ibarra-Rojas OJ, Cabo M, Possani E (2020) A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production. Eur J Oper Res 284(3):861–873

    Article  Google Scholar 

  • Santos F, Fukasawa R, Ricardez-Sandoval L (2018) An integrated personnel allocation and machine scheduling problem for industrial size multipurpose plants. In: Proceedings of the 10th IFAC international symposium on advanced control of chemical processes, China

  • Seifi C, Schulze M, Zimmermann J (2021) A new mathematical formulation for a potash-mine shift scheduling problem with a simultaneous assignment of machines and workers. Eur J Oper Res 292(1):27–42

    Article  Google Scholar 

  • Schulze M, Zimmermann J (2017) Staff and machine shift scheduling in a German potash mine. J Sched 20:635–656

    Article  Google Scholar 

  • Spring P (2013) The challenge of cost effective poultry and animal nutrition: optimizing existing and applying novel concepts. Lohman Inf 48(1):38–46

    Google Scholar 

  • Sun X, Guo S, Guo J, Du B (2019) A hybrid multi-objective evolutionary algorithm with heuristic adjustment strategies and variable neighborhood search for flexible job-shop scheduling problem considering flexible rest time. IEEE Access 7:157003–157018

    Article  Google Scholar 

  • Toledo CFM, Arantes MS, França PM, Morabito R (2012) A memetic framework for solving the lot sizing and scheduling problem in soft drink plants. In: Chiong R, Weise T, Michalewicz Z (eds) Variants of evolutionary algorithms for real-world applications. Springer, Berlin

    Google Scholar 

  • Toledo CFM, Arantes MdS, Hossomi MYB, Franca PM, Akartunali K (2015) A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems. J Heuristics 21(5):687–717

    Article  Google Scholar 

  • Toscano A, Ferreira D, Morabito R (2020) Formulation and MIP-heuristics for the lot sizing and scheduling problem with temporal cleanings. Comput Chem Eng 142:107038

    Article  Google Scholar 

  • Unlu Y, Mason, SJ (2010) Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems. Comput Ind Eng 58(4):785–800

  • Xiao J, Yang H, Zhang C, Zheng L, Gupta JN (2015) A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times. Comput Oper Res 63:72–82

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Belgrade, The Faculty of Transport and Traffic Engineering, Vojvode Stepe 305, 11000, Belgrade, Serbia

    Miloš Milenković & Nebojša Bojović

  2. Zaragoza Logistic Center, Avenida Ranillas, 5 - Edificio A bajo, 50018, Zaragoza, Spain

    Susana Val

Authors
  1. Miloš Milenković
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Susana Val
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nebojša Bojović
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Miloš Milenković.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Milenković, M., Val, S. & Bojović, N. Simultaneous lot sizing and scheduling in the animal feed premix industry. Oper Res Int J 23, 33 (2023). https://doi.org/10.1007/s12351-023-00772-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s12351-023-00772-y

Keywords

Search

Navigation