IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v159y2008i1p315-33110.1007-s10479-007-0285-y.html
   My bibliography  Save this article

Optimal production scheduling for the dairy industry

Author

Listed:
  • Philip Doganis
  • Haralambos Sarimveis

Abstract

The increasing variety of products offered by the food industry has helped the industry to respond to market trends, but at the same time has resulted in a more complex production process, which requires flexibility and an efficient coordination of existing resources. Especially in industrial yogurt production, there is a wide variety of products that differ in features like fat content, the whey used to produce the mixture, the flavor, the size of the container or the language on the label. The great diversification and the special features that characterize yogurt production lines (satisfaction of multiple due dates, variable processing times, sequence-dependent setup times and costs and monitoring of inventory levels), render generic scheduling methodologies impractical for real-world applications. In this work we present a customized Mixed Integer Linear Programming (MILP) model for optimizing yogurt packaging lines that consist of multiple parallel machines. The model is characterized by parsimony in the utilization of binary variables and necessitates the use of only a small pre-determined number of time periods. The efficiency of the proposed model is illustrated through its application to the yogurt production plant of a leading dairy product manufacturing company in Greece. Copyright Springer Science+Business Media, LLC 2008

Suggested Citation

  • Philip Doganis & Haralambos Sarimveis, 2008. "Optimal production scheduling for the dairy industry," Annals of Operations Research, Springer, vol. 159(1), pages 315-331, March.
  • Handle: RePEc:spr:annopr:v:159:y:2008:i:1:p:315-331:10.1007/s10479-007-0285-y
    DOI: 10.1007/s10479-007-0285-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0285-y
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-007-0285-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jose Pinto & Ignacio Grossmann, 1998. "Assignment and sequencing models for thescheduling of process systems," Annals of Operations Research, Springer, vol. 81(0), pages 433-466, June.
    2. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    3. Sungmin Kang & Kavindra Malik & L. Joseph Thomas, 1999. "Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs," Management Science, INFORMS, vol. 45(2), pages 273-289, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Stefansdottir, Bryndis & Grunow, Martin & Akkerman, Renzo, 2017. "Classifying and modeling setups and cleanings in lot sizing and scheduling," European Journal of Operational Research, Elsevier, vol. 261(3), pages 849-865.
    2. Stüve, David & van der Meer, Robert & Lütke Entrup, Matthias & Agha, Mouhamad Shaker Ali, 2020. "Supply chain planning in the food industry," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Kersten, Wolfgang & Blecker, Thorsten & Ringle, Christian M. (ed.), Data Science and Innovation in Supply Chain Management: How Data Transforms the Value Chain. Proceedings of the Hamburg International Conference of Lo, volume 29, pages 317-353, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
    3. Yiyi Xu & M’hammed Sahnoun & Fouad Ben Abdelaziz & David Baudry, 2022. "A simulated multi-objective model for flexible job shop transportation scheduling," Annals of Operations Research, Springer, vol. 311(2), pages 899-920, April.
    4. Bilge Bilgen & Yelda Çelebi, 2013. "Integrated production scheduling and distribution planning in dairy supply chain by hybrid modelling," Annals of Operations Research, Springer, vol. 211(1), pages 55-82, December.
    5. Mili Mehrotra & Milind Dawande & Srinagesh Gavirneni & Mehmet Demirci & Sridhar Tayur, 2011. "OR PRACTICE---Production Planning with Patterns: A Problem from Processed Food Manufacturing," Operations Research, INFORMS, vol. 59(2), pages 267-282, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Monkman, Susan K. & Morrice, Douglas J. & Bard, Jonathan F., 2008. "A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1100-1114, June.
    2. Susan Heath & Jonathan Bard & Douglas Morrice, 2013. "A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines," Annals of Operations Research, Springer, vol. 203(1), pages 295-323, March.
    3. Zhi‐Long Chen & Warren B. Powell, 2003. "Exact algorithms for scheduling multiple families of jobs on parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(7), pages 823-840, October.
    4. Marko Ɖurasević & Domagoj Jakobović, 2019. "Creating dispatching rules by simple ensemble combination," Journal of Heuristics, Springer, vol. 25(6), pages 959-1013, December.
    5. Byung-Cheon Choi & Myoung-Ju Park, 2015. "A Batch Scheduling Problem with Two Agents," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(06), pages 1-19, December.
    6. Li, Nianqi & Klemeš, Jiří Jaromír & Sunden, Bengt & Wu, Zan & Wang, Qiuwang & Zeng, Min, 2022. "Heat exchanger network synthesis considering detailed thermal-hydraulic performance: Methods and perspectives," Renewable and Sustainable Energy Reviews, Elsevier, vol. 168(C).
    7. Lara, Cristiana L. & Koenemann, Jochen & Nie, Yisu & de Souza, Cid C., 2023. "Scalable timing-aware network design via lagrangian decomposition," European Journal of Operational Research, Elsevier, vol. 309(1), pages 152-169.
    8. Christodoulos Floudas & Xiaoxia Lin, 2005. "Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications," Annals of Operations Research, Springer, vol. 139(1), pages 131-162, October.
    9. Yanina Fumero & Gabriela Corsano & Jorge Montagna, 2012. "Planning and scheduling of multistage multiproduct batch plants operating under production campaigns," Annals of Operations Research, Springer, vol. 199(1), pages 249-268, October.
    10. Dunstall, Simon & Wirth, Andrew, 2005. "A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines," European Journal of Operational Research, Elsevier, vol. 167(2), pages 283-296, December.
    11. Löhndorf, Nils & Riel, Manuel & Minner, Stefan, 2014. "Simulation optimization for the stochastic economic lot scheduling problem with sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 157(C), pages 170-176.
    12. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    13. Brucker, Peter & Knust, Sigrid & Wang, Guoqing, 2005. "Complexity results for flow-shop problems with a single server," European Journal of Operational Research, Elsevier, vol. 165(2), pages 398-407, September.
    14. Hinder, Oliver & Mason, Andrew J., 2017. "A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 262(2), pages 411-423.
    15. Ravindran Vijayalakshmi, Vipin & Schröder, Marc & Tamir, Tami, 2024. "Minimizing total completion time with machine-dependent priority lists," European Journal of Operational Research, Elsevier, vol. 315(3), pages 844-854.
    16. Haugen, Kjetil K. & Olstad, Asmund & Pettersen, Bard I., 2007. "The profit maximizing capacitated lot-size (PCLSP) problem," European Journal of Operational Research, Elsevier, vol. 176(1), pages 165-176, January.
    17. repec:dgr:rugsom:02a72 is not listed on IDEAS
    18. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    19. Lukac, Zrinka & Soric, Kristina & Rosenzweig, Visnja Vojvodic, 2008. "Production planning problem with sequence dependent setups as a bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1504-1512, June.
    20. Havill, Jessen T. & Mao, Weizhen, 2008. "Competitive online scheduling of perfectly malleable jobs with setup times," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1126-1142, June.
    21. Dirk Briskorn & Konrad Stephan & Nils Boysen, 2022. "Minimizing the makespan on a single machine subject to modular setups," Journal of Scheduling, Springer, vol. 25(1), pages 125-137, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:159:y:2008:i:1:p:315-331:10.1007/s10479-007-0285-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.