Skip to main content

Advertisement

Log in

Sequencing and scheduling for filling lines in dairy production

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We consider an integrated sequencing and scheduling problem arising at filling lines in dairy industry. Even when a processing sequence is decided, still a scheduling problem has to be solved for the sequence. This incorporates typical side constraints as they occur also in other sequencing problems in practice. Previously, we proposed a framework for general sequencing and scheduling problems: A genetic algorithm is utilized for the sequencing, incorporating a problem specific algorithm for the fixed-sequence scheduling. In this paper, we investigate how this approach performs for filling lines. Based on insights into structural properties of the problem, we propose different scheduling algorithms. In cooperation with Sachsenmilch GmbH, the algorithm was implemented for their bottleneck filling line, and evaluated in an extensive computational study. For the real data from production, our algorithm computes almost optimal solutions. However, as a surprising result, our simple greedy algorithms outperform the more elaborate ones in many aspects, showing interesting directions for future research.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aarts, E., Lenstra, J.K. (eds): Local Search in Combinatorial Optimization. Wiley, Hoboken (1997)

    MATH  Google Scholar 

  2. Allahverdi A., Ng C.T., Cheng T.C.E, Kovalyov M.Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985–1032 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Balas E., Simonetti N., Vazacopoulos A.: Job shop scheduling with setup times, deadlines and precedence constraints. J. Sched. 11(4), 253–262 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dijkstra E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  5. Doganis Ph., Sarimveis H.: Optimal production scheduling for the dairy industry. Ann. Oper. Res. 159(1), 315–331 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  6. Estellon B., Gardi F., Nouioua K.: Two local search approaches for solving real-life car sequencing problems. Eur. J. Oper. Res. 191(3), 928–944 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  7. Garey M.R., Johnson D.S.: Computers and intractability. W. H. Freeman, New York (1979)

    MATH  Google Scholar 

  8. Helsgaun K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106–130 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Höhn W., König F.G., Lübbecke M.E., Möhring R.H.: Integrated sequencing and scheduling in coil coating. Manage. Sci. 57, 647–666 (2011)

    Article  MATH  Google Scholar 

  10. Kopanos G.M., Puigjaner L., Georgiadis M.C.: Optimal production scheduling and lot-sizing in dairy plants: The yogurt production line. Ind. Eng. Chem. Res. 49, 701–718 (2010)

    Article  Google Scholar 

  11. Koulamas C., Kyparisis G.J.: Single-machine scheduling problems with past-sequence-dependent setup times. Eur. J. Oper. Res. 187(3), 1045–1049 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lütke-Entrup M.M., Günther H.-O., van Beek P., Grunow M., Seiler T.: Mixed-integer linear programming approaches to shelf-life-integrated planning and scheduling in yoghurt production. Int. J. Prod. Res. 43(23), 5071–5100 (2005)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Meloni, C., Naso, D., Turchiano, B.: Multi-objective evolutionary algorithms for a class of sequencing problems in manufacturing environments. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, pp. 8–13 (2003)

  15. Mühlenbein H., Gorges-Schleuter M., Krämer O.: Evolution algorithms in combinatorial optimization. Parallel Comput. 7(1), 65–85 (1988)

    Article  MATH  Google Scholar 

  16. Papadimitriou C.H., Yannakakis M.: The traveling salesman problem with distances one and two. Math. Oper. Res. 18(1), 1–11 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  17. Potts C.N., Kovalyov M.Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120(2), 228–249 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wiebke Höhn.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gellert, T., Höhn, W. & Möhring, R.H. Sequencing and scheduling for filling lines in dairy production. Optim Lett 5, 491–504 (2011). https://doi.org/10.1007/s11590-011-0336-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0336-9

Keywords

Navigation