Skip to main content
SpringerLink
Log in

Distributed Manufacturing as a Scheduling Problem

  • Chapter
  • First Online:
Performance Evaluation Models for Distributed Service Networks

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 343))

  • 174 Accesses

Abstract

In this chapter, we consider a distributed production system modeled and analyzed by means of the extended open-shop scheduling problem with transport times and the makespan criterion. The stated problem is more general than these considered by us so far as well those found in the literature. The stated problem has been decomposed into two scheduling sub-problems: processing of jobs in each factory and transfer of jobs between factories. These schedules can be represented by two job orders: “processing order” and “transfer order”. The overall aim of the optimization task is stated to find the optimal/best job orders. We provide the mathematical model to find the non-delay schedule for the given job orders. Next, we formulate a graph model and introduce special properties, suitable to check the feasibility of job orders as well as to calculate the makespan value. The properties have been used in the neighborhood dedicated for local search methods. We have implemented the tabu search algorithm and tested experimentally its performance.

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

Access this chapter

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 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 179.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. Bai, D., Tang, L.: Open shop scheduling problem to minimize makespan with release dates. Appl. Math. Model. 37(4), 2008–2015 (2013)

    Article  MathSciNet  Google Scholar 

  2. Blażewicz, J., Pesch, E., Sterna, M., Werner, F.: Open shop scheduling problems with late work criteria. Discret. Appl. Math. 134(1), 1–24 (2004)

    Google Scholar 

  3. Bocewicz, G., Wójcik, R., Banaszak, Z.: Agvs distributed control subject to imprecise operation Times. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4953 LNAI, 421–430 (2008). https://doi.org/10.1007/978-3-540-78582-8_43

  4. Bożejko, W., Wodecki, M.: Parallel genetic algorithm for the flow shop scheduling problem. Lecture Notes in Computer Science 3019, pp. 566–571. Springer (2004)

    Google Scholar 

  5. Bożejko, W., Uchroński, M., Wodecki, M.: Parallel hybrid metaheuristics for the flexible job shop problem. Computers & Industrial Engineering 59(2), 323–333 (2010)

    Google Scholar 

  6. Fardin, A., Mehdi, H., F.: A novel hybrid genetic algorithm for the open shop scheduling problem. The International Journal of Advanced Manufacturing Technology 62 (5) 775–787, (2012)

    Google Scholar 

  7. Gao, J., Chen, R.: A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem. International Journal of Computational Intelligence Systems 4 (4) 497–508, (2011)

    Google Scholar 

  8. Gao, J., Chen, R., Deng,W.: An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem International Journal of Production Research 51 (3) 641–651, (2013)

    Google Scholar 

  9. Glover, F.: Tabu Search - Part 1. ORSA Journal on Computing 1(3), 190–206 (1989). https://doi.org/10.1287/ijoc.1.3.190

  10. Grabowski, J., Wodecki, M.: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput. Oper. Res. 31(11), 1891–1909 (2004)

    Article  MathSciNet  Google Scholar 

  11. Guéret, C., Prins, C.: Classical and new heuristics for the open-shop problem: a computational evaluation. Eur. J. Oper. Res. 107(2), 306–314 (1998)

    Article  Google Scholar 

  12. Hao-Chin, C., Tung-Kuan, L.: Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms. J. Intell. Manuf. 28(8), 1973–1986 (2017)

    Article  Google Scholar 

  13. Hsu, C., Kao, B., Ho, V.L., Lai, K.R.: Agent-based fuzzy constraint-directed negotiation mechanism for distributed job shop scheduling. Eng. Appl. Artif. Intell. 53, 140–154 (2016)

    Article  Google Scholar 

  14. Jia, H., Fuh, J., Nee, A., Zhang, Y.: Integration of genetic algorithm and Gantt chart for job shop scheduling in distributed manufacturing systems. Comput. Ind. Eng. 53(2), 313–320 (2007)

    Article  Google Scholar 

  15. Kyparisis, G.J., Koulamas, C.: Open shop scheduling with maximal machines. Discret. Appl. Math. 78(1), 175–187 (1997)

    Article  MathSciNet  Google Scholar 

  16. Li, J., Bai, S., Duan, P., Sang, H., Han, Y., Zheng, Z.: An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system. Int. J. Prod. Res. 57(22), 6922–6942 (2019)

    Article  Google Scholar 

  17. Liaw, C.: A hybrid genetic algorithm for the open shop scheduling problem. Eur. J. Oper. Res. 124(1), 28–42 (2000)

    Article  MathSciNet  Google Scholar 

  18. Naderi, B., FatemiGhomi, S.M.T., Aminnayeri, M., Zandieh, M.: A contribution and new heuristics for open shop scheduling. Comput. Oper. Res. 37, 213–221 (2010)

    Article  MathSciNet  Google Scholar 

  19. Naderi, B., Ghomi, S.F., Aminnayeri, M.Z.M.: ieh: a study on open shop scheduling to minimise total tardiness. Int. J. Prod. Res. 49(15), 4657–678 (2011)

    Article  Google Scholar 

  20. Naderi, B., Ruiz, R.: A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur. J. Oper. Res. 239(2), 323–334 (2014)

    Article  MathSciNet  Google Scholar 

  21. Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manag. Sci. 42(6), 783–938 (1996)

    Article  Google Scholar 

  22. Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flow-shop problem. Eur. J. Oper. Res. 91(1), 160–175 (1996)

    Article  Google Scholar 

  23. Pempera, J., Smutnicki, C.: Open shop cyclic scheduling. Eur. J. Oper. Res. 269(2), 773–781 (2018)

    Article  MathSciNet  Google Scholar 

  24. Ruiz, R., Pan, Q., Naderi, B.: Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega 83, 213–222 (2019)

    Article  Google Scholar 

  25. Samaneh, N., Reza, T.: Minimizing the total tardiness and makespan in an open shop scheduling problem with sequence-dependent setup times. J. Ind. Eng. Int. 8(1), 25 (2012)

    Article  Google Scholar 

  26. Sha, D., Hsu, C.: A new particle swarm optimization for the open shop scheduling problem. Comput. Oper. Res. 35(10), 3243–3261 (2008)

    Article  Google Scholar 

  27. Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278–285 (1993)

    Article  MathSciNet  Google Scholar 

  28. Watson, J., Howe, A.E., Whitley, L.D.: Deconstructing Nowicki and Smutnicki’s i-TSAB tabu search algorithm for the job-shop scheduling problem. Comput. Oper. Res. 33(9), 2623–2644 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Control Systems and Mechatronics, Faculty of Electronics, Wrocław University of Science and Technology, 27 Wybrzełe Wyspiańskiego St., 50-372, Wrocław, Poland

    Jarosław Pempera

  2. Department of Computer Engineering, Faculty of Electronics, Wrocław University of Science and Technology, 27 Wybrzełe Wyspiańskiego St., 50-372, Wrocław, Poland

    Czesław Smutnicki & Robert Wójcik

Authors
  1. Jarosław Pempera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Czesław Smutnicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert Wójcik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jarosław Pempera .

Editor information

Editors and Affiliations

  1. Faculty of Electronics and Computer Science, Koszalin University of Technology, Koszalin, Poland

    Grzegorz Bocewicz

  2. Faculty of Electronics, Department of Control Systems and Mechatronics, Wrocław University of Science and Technology, Wrocław, Poland

    Jarosław Pempera

  3. Department of Computing Technologies, Institute of Information Technologies and Computer Science, National Research University “MPEI”, Moscow, Russia

    Victor Toporkov

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Pempera, J., Smutnicki, C., Wójcik, R. (2021). Distributed Manufacturing as a Scheduling Problem. In: Bocewicz, G., Pempera, J., Toporkov, V. (eds) Performance Evaluation Models for Distributed Service Networks. Studies in Systems, Decision and Control, vol 343. Springer, Cham. https://doi.org/10.1007/978-3-030-67063-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-67063-4_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-67062-7

  • Online ISBN: 978-3-030-67063-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation