Skip to main content
SpringerLink
Log in
Book cover

Algorithm Engineering pp 330–351Cite as

Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications

  • Chapter
  • First Online:

  • 4273 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9220))

Abstract

A huge number of problems in production planning ask for a somewhat good processing sequence. While all those problems share the common sequencing aspect, the underlying side constraints, and hence, the related scheduling decisions, are highly problem-specific. We propose a generic algorithmic framework which aims at separating the side constraints from the general sequencing decisions. This allows us to only focus on the optimization problem that remains when the processing sequence is already decided—in many cases yet another NP-hard problem. Compared to the overall problem, this subproblem is far more manageable. In cooperation with industry, our approach has been applied to problems of planning (sheet metal) coil coating lines and dairy filling lines, respectively. For the subproblem of the coil coating problem, we could observe a close relation to the maximum weight independent set problem on a special class of multiple-interval graphs. Thorough insights into this problem were finally the basis for achieving a makespan reduction of over \(13\%\) on average for the coil coating line of our industrial partner. For the less complex dairy problem, our solutions were on par with the manual production plans in use at the production site of our project partner. We could show that this solution is almost optimal, i.e., within a factor of 1.02 times a lower bound.

Supported by the German Research Foundation (DFG) as part of the Priority Program “Algorithm Engineering.”.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    http://challenge.roadef.org/2005/en/.

  2. 2.

    This success has made this contribution a finalist of the 2009 EURO Excellence in Practice Award.

References

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

    MATH  Google Scholar 

  2. Akkerman, R., van Donk, D.P.: Analyzing scheduling in the food-processing industry: structure and tasks. Cogn. Technol. Work 11, 215–226 (2009)

    Article  Google Scholar 

  3. 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, 985–1032 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Bampis, E., Guinand, F., Trystram, D.: Some models for scheduling parallel programs with communication delays. Discrete Appl. Math. 72, 5–24 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bellabdaoui, A., Teghem, J.: A mixed-integer linear programming model for the continuous casting planning. Int. J. Prod. Econ. Theor. Issues Prod. Sched. Control Plan. Control Supply Chains Prod. 104, 260–270 (2006)

    Google Scholar 

  8. Claassen, G.D.H., van Beek, P.: Planning and scheduling. Eur. J. Oper. Res. 70, 150–158 (1993)

    Article  MATH  Google Scholar 

  9. Cowling, P.: A flexible decision support system for steel hot rolling mill scheduling. Comput. Ind. Eng. 45, 307–321 (2003)

    Article  Google Scholar 

  10. Delucchi, M., Barbucci, A., Cerisola, G.: Optimization of coil coating systems by means of electrochemical impedance spectroscopy. Electrochim. Acta 44, 4297–4305 (1999)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. Gellert, T., Höhn, W., Möhring, R.H.: Sequencing, scheduling for filling lines in dairy production. Optim. Lett. 5, 491–504 (2011). Special issue of SEA 2011

    Article  MathSciNet  MATH  Google Scholar 

  13. Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Springer, New York (2002)

    MATH  Google Scholar 

  14. Hall, N.G., Potts, C.N., Sriskandarajah, C.: Parallel machine scheduling with a common server. Discrete Appl. Math. 102, 223–243 (2000)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  16. Höhn, W., Jacobs, T.: An experimental and analytical study of order constraints for single machine scheduling with quadratic cost. In: Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX), pp. 103–117. SIAM (2012)

    Google Scholar 

  17. Höhn, W., Jacobs, T.: On the performance of Smith’s rule in single-machine scheduling with nonlinear cost. ACM Trans. Algorithms (2014, to appear)

    Google Scholar 

  18. 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 

  19. 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 

  20. Kopanos, G.M., Puigjaner, L., Georgiadis, M.C.: Efficient mathematical frameworks for detailed production scheduling in food processing industries. Comput. Chem. Eng. 42, 206–216 (2012)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  24. 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)

    Google Scholar 

  25. Meuthen, B., Jandel, A.-S.: Coil Coating. Vieweg, Wiesbaden (2005)

    Book  Google Scholar 

  26. Möhring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I. (ed.) Graphs and Order. NATO ASI Series, vol. 147, pp. 41–101. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  29. Perrello, B.D., Kabat, W.C.: Job-shop scheduling using automated reasoning: a case study of the car-sequencing problem. J. Autom. Reason. 2, 1–42 (1986)

    MathSciNet  Google Scholar 

  30. Rekieck, B., De Lit, P., Delchambre, A.: Designing mixed-product assembly lines. IEEE Trans. Robot. Autom. 16, 268–280 (2000)

    Article  Google Scholar 

  31. Sahni, S., Gonzalez, T.F.: P-complete approximation problems. J. ACM 23, 555–565 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  32. Smith, W.E.: Various optimizers for single-stage production. Naval Res. Logist. Q. 3, 59–66 (1956)

    Article  MathSciNet  Google Scholar 

  33. Solnon, C., Cung, V.D., Nguyen, A., Artigues, C.: The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF’2005 challenge problem. Eur. J. Oper. Res. 191, 912–927 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  34. Tang, L., Liu, J., Rong, A., Yang, Z.: A review of planning and scheduling systems and methods for integrated steel production. Eur. J. Oper. Res. 133, 1–20 (2001)

    Article  MATH  Google Scholar 

  35. Tang, L., Wang, X.: Simultaneously scheduling multiple turns for steel color-coating production. Eur. J. Oper. Res. 198, 715–725 (2009)

    Article  MATH  Google Scholar 

  36. van Dam, P., Gaalman, G., Sierksma, G.: Scheduling of packaging lines in the process industry: an empirical investigation. Int. J. Prod. Econ. 30–31, 579–589 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Für Mathematik, Technische Universität Berlin, Straße des 17. Juni 136, 10623, Berlin, Germany

    Wiebke Höhn & Rolf H. Möhring

Authors
  1. Wiebke Höhn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolf H. Möhring
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rolf H. Möhring .

Editor information

Editors and Affiliations

  1. Kiel University , Kiel, Germany

    Lasse Kliemann

  2. Karlsruhe Institute of Technology , Karlsruhe, Germany

    Peter Sanders

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this chapter

Cite this chapter

Höhn, W., Möhring, R.H. (2016). Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial Applications. In: Kliemann, L., Sanders, P. (eds) Algorithm Engineering. Lecture Notes in Computer Science(), vol 9220. Springer, Cham. https://doi.org/10.1007/978-3-319-49487-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49487-6_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49486-9

  • Online ISBN: 978-3-319-49487-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation