Skip to main content
SpringerLink
Log in
Book cover

International Conference on Industrial Applications of Holonic and Multi-Agent Systems

HoloMAS 2017: Industrial Applications of Holonic and Multi-Agent Systems pp 11–23Cite as

Total Setup Time Minimisation in Production Scheduling with Alternatives

  • Conference paper
  • First Online:

  • 1340 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10444))

Abstract

The research presented in this paper is focused on the scheduling problem with alternative process plans where the goal is to minimise the sum of all the performed setup times in the schedule. The setup times play an important role in scheduling problems, yet they are, in most cases, considered only as an additional constraint, not as a part of the objective function. We propose a model, based on the resource constrained project scheduling problem with alternative process plans, release times and deadlines, that includes the setup times in the scheduling criterion. Both the exact mathematical model and the new heuristic algorithm are proposed to solve the problem. The effectiveness of the proposed two-phase heuristic algorithm, designed with the intention to solve the large instances of the problem, is evaluated on a wide set of instances.

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

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Barták, R., Čepek, O.: Temporal networks with alternatives: complexity and model. In: Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference (FLAIRS), Florida, USA, pp. 641–646. AAAI Press (2007)

    Google Scholar 

  3. Barták, R., Čepek, O.: Nested temporal networks with alternatives: recognition and tractability. In: Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), Ceara, Brazil, pp. 156–157. ACM (2008)

    Google Scholar 

  4. Beck, J.C., Fox, M.S.: Constraint-directed techniques for scheduling alternative activities. Artif. Intell. 121(1), 211–250 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes. Springer, New York (1996). doi:10.1007/978-3-662-04363-9

    Book  MATH  Google Scholar 

  6. Brucker, P.: Scheduling Algorithms. Springer, New York (2007). doi:10.1007/978-3-540-69516-5

    MATH  Google Scholar 

  7. Brucker, P., Drexl, A., Mohring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3–41 (1999)

    Article  MATH  Google Scholar 

  8. Brucker, P., Knust, S.: Complexity results for single-machine problems with positive finish-start time-lags. Computing 63(4), 219–316 (1998)

    MathSciNet  MATH  Google Scholar 

  9. Brucker, P., Kunst, S.: Complex Scheduling. Springer, New York (2006). doi:10.1007/3-540-29546-1

    Google Scholar 

  10. Brucker, P., Thiele, O.: A branch & bound method for the general-shop problem with sequence dependent setup-times. Oper. Res. Spectr. 18(3), 145–161 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  11. Čapek, R., Šůcha, P., Hanzálek, Z.: Production scheduling with alternative process plans. Eur. J. Oper. Res. 217(2), 300–311 (2012)

    MathSciNet  MATH  Google Scholar 

  12. De Reyck, B., Herroelen, W.: The multi-mode resource-constrained project scheduling problem with generalized precedence relations. Eur. J. Oper. Res. 119(2), 538–556 (1999)

    Article  MATH  Google Scholar 

  13. Demeulemeester, E., Herroelen, W.: A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manage. Sci. 38(12), 1803–1818 (1992)

    Article  MATH  Google Scholar 

  14. Focacci, F., Laborie, P., Nuijten, W.: Solving scheduling problems with setup times and alternative resources. In: Artificial Intelligence Planning Systems 2000 Proceedings (AIPS), pp. 1–10. AIPS (2000)

    Google Scholar 

  15. Hartmann, S., Briskorn, D.: A survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 207(1), 1–14 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  16. Herroelen, W., De Reyck, B., Demeulemeester, E.: Resource-constrained project scheduling: a survey of recent developments. Comput. Oper. Res. 25(4), 279–302 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  17. Herroelen, W., De Reyck, B., Demeulemeester, E.: A classification scheme for project scheduling. In: Weglarz, J. (ed.) Handbook of Recent Advances in Project Scheduling, pp. 1–26. Kluwer Academic Publishers, Dordrecht (1999)

    Google Scholar 

  18. Kadrou, Y., Najid, N.M.: A new heuristic to solve RCPSP with multiple execution modes and multi-skilled labor. In: Proceedings of the IMACS Multiconference on Computational Engineering in Systems Applications (CESA), pp. 1–8. IEEE (2006)

    Google Scholar 

  19. Kis, T.: Job-shop scheduling with processing alternatives. Eur. J. Oper. Res. 151(2), 307–322 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  20. Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur. J. Oper. Res. 174(1), 23–37 (2006)

    Article  MATH  Google Scholar 

  21. Kolisch, R., Padman, R.: An integrated survey of deterministic project scheduling. Omega Int. J. Manag. Sci. 29(3), 249–272 (2001)

    Article  Google Scholar 

  22. Leung, C.W., Wong, T.N., Maka, K.L., Fung, R.Y.K.: Integrated process planning and scheduling by an agent-based ant colony optimization. Comput. Ind. Eng. 59(1), 166–180 (2010)

    Article  Google Scholar 

  23. Li, X., Zhang, C., Gao, L., Li, W., Shao, X.: An agent-based approach for integrated process planning and scheduling. Expert Syst. Appl. 37(2), 1256–1264 (2010)

    Article  Google Scholar 

  24. Mirabi, M.: A hybrid simulated annealing for the single-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times and costs and dynamic release of jobs. Int. J. Adv. Manuf. Technol. 54(9–12), 795–808 (2010)

    Google Scholar 

  25. Neumann, K., Schwindt, C., Zimmermann, J.: Project Scheduling with Time Windows and Scarce Resources. Springer, Heidelberg (2003). doi:10.1007/978-3-540-24800-2

    Book  MATH  Google Scholar 

  26. Salewski, F., Schirmer, A., Drexl, A.: Project scheduling under resource and mode identity constraints: model, complexity, methods and application. Eur. J. Oper. Res. 102(1), 88–110 (1997)

    Article  MATH  Google Scholar 

  27. Shao, X., Li, X., Gao, L., Zhang, C.: Integration of process planning and scheduling - a modified genetic algorithm-based approach. Comput. Oper. Res. 36(6), 2082–2096 (2009)

    Article  MATH  Google Scholar 

  28. Van Peteghem, V., Vanhoucke, M.: An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances. Technical report, Faculty of Economics and Business Adminstration (Ghent University) (2011)

    Google Scholar 

  29. Van Peteghem, V., Vanhoucke, M.: Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem. J. Heuristics 17(6), 705–728 (2011)

    Article  MATH  Google Scholar 

  30. Wang, L., Wang, M.: A hybrid algorithm for earliness-tardiness scheduling problem with sequence dependent setup time. In: Proceedings of the 36th Conference on Decision and Control, pp. 1219–1223. IEEE (1997)

    Google Scholar 

  31. Yuan, X.M., Khoo, H.H., Spedding, T.A., Bainbridge, I., Taplin, D.M.R.: Minimizing total setup cost for a metal casting company. Winter Simul. Conf. 2, 1189–1194 (2004)

    Google Scholar 

Download references

Acknowledgments

This work was supported by the Grant Agency of the Czech Republic under the Project FOREST GACR P103-16-23509S and by the Project AI&Reasoning CZ.02.1.01/0.0/0.0/15_003/0000466 and the European Regional Development Fund.

Author information

Authors and Affiliations

  1. FEE, Czech Technical University in Prague, Karlovo náměstí. 13, 121 35, Prague 2, Czech Republic

    Zdeněk Hanzálek, Roman Čapek & Přemysl Šůcha

  2. CIIRC, Czech Technical University in Prague, Jugoslávských partyzánů 1580/3, 160 00, Prague 6, Czech Republic

    Zdeněk Hanzálek & Přemysl Šůcha

Authors
  1. Zdeněk Hanzálek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roman Čapek
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Přemysl Šůcha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zdeněk Hanzálek .

Editor information

Editors and Affiliations

  1. Czech Technical University, Prague, Czech Republic

    Vladimír Mařík

  2. German Research Center for AI, Saarbrücken, Germany

    Wolfgang Wahlster

  3. Austrian Institute of Technology, Vienna, Austria

    Thomas Strasser

  4. Czech Technical University, Prague, Czech Republic

    Petr Kadera

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Hanzálek, Z., Čapek, R., Šůcha, P. (2017). Total Setup Time Minimisation in Production Scheduling with Alternatives. In: Mařík, V., Wahlster, W., Strasser, T., Kadera, P. (eds) Industrial Applications of Holonic and Multi-Agent Systems. HoloMAS 2017. Lecture Notes in Computer Science(), vol 10444. Springer, Cham. https://doi.org/10.1007/978-3-319-64635-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-64635-0_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-64634-3

  • Online ISBN: 978-3-319-64635-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation