Skip to main content

Parallel Tabu Search Algorithm with Uncertain Data for the Flexible Job Shop Problem

  • Conference paper
  • First Online:
Artificial Intelligence and Soft Computing (ICAISC 2016)

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

Included in the following conference series:

Abstract

In many real production systems the parameters of individual operations are not deterministic. Typically, they can be modeled by fuzzy numbers or distributions of random variables. In this paper we consider the flexible job shop problem with machine setups and uncertain times of operation execution. Not only we present parallel algorithm on GPU with fuzzy parameters but also we investigate its resistance to random disturbance of the input data.

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

Access this chapter

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

Institutional subscriptions

References

  1. Balin, S.: Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation. Inf. Sci. 161, 3551–3569 (2011)

    Article  Google Scholar 

  2. Bożejko, W., Wodecki, M.: On the theoretical properties of swap multimoves. Oper. Res. Lett. 35(2), 227–231 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bożejko, W., Uchroski, M., Wodecki, M.: The new golf neighborhood for the flexible job shop problem. In: Proceedings of the ICCS 2010, Procedia Computer Science 1, pp. 289–296. Elsevier (2010)

    Google Scholar 

  4. Bożejko, W., Uchroski, M., Wodecki, M.: Solving the flexible job shop problem on Multi-GPU. In: Proceedings of the ICCS 2012, Procedia Computer Science 9, pp. 378–394. Elsevier (2012)

    Google Scholar 

  5. Bożejko, W., Uchroski, M., Wodecki, M.: Block approach to the cyclic flow shop scheduling. Comput. Ind. Eng. 81, 158–166 (2015)

    Article  Google Scholar 

  6. Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41, 157–183 (1993)

    Article  MATH  Google Scholar 

  7. Dubois, D., Prade, H.: Theorie des Possibilites. Applications a la representation des connaissances en informatique. Masson, Paris (1988)

    MATH  Google Scholar 

  8. Hodgson, T.J., King, R.E., Stanfield, P.M.: Ready-time scheduling with stochastic service time. Oper. Res. 45(5), 779–783 (1997)

    Article  MATH  Google Scholar 

  9. Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. OMEGA Int. J. Manag. Sci. 11, 91–95 (1983)

    Article  Google Scholar 

  10. Prade, H.: Uzing fuzzy set theory in a scheduling problem. Fuzzy Sets Syst. 2, 153–165 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  11. Sowiski, R., Hapke, M.: Scheduling under Fuzziness. Physica-Verlag, New York (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wojciech Bożejko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Bożejko, W., Uchroński, M., Wodecki, M. (2016). Parallel Tabu Search Algorithm with Uncertain Data for the Flexible Job Shop Problem. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2016. Lecture Notes in Computer Science(), vol 9693. Springer, Cham. https://doi.org/10.1007/978-3-319-39384-1_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39384-1_36

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39383-4

  • Online ISBN: 978-3-319-39384-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics