Skip to main content

Comparative Study of Meta-heuristics for Solving Flow Shop Scheduling Problem Under Fuzziness

  • Conference paper
Bio-inspired Modeling of Cognitive Tasks (IWINAC 2007)

Abstract

In this paper we propose a hybrid method, combining heuristics and local search, to solve flow shop scheduling problems under uncertainty. This method is compared with a genetic algorithm from the literature, enhanced with three new multi-objective functions. Both single objective and multi-objective approaches are taken for two optimisation goals: minimisation of completion time and fulfilment of due date constraints. We present results for newly generated examples that illustrate the effectiveness of each method.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  2. Brucker, P., Knust, S.: Complex Scheduling. Springer, Heidelberg (2006)

    Google Scholar 

  3. Dubois, D., Fargier, H., Fortemps, P.: Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge. European Journal of Operational Research 147, 231–252 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Słowiński, R., Hapke, M. (eds.): Scheduling Under Fuzziness. Studies in Fuzziness and Soft Computing, vol. 37. Physica-Verlag, Heidelberg (2000)

    Google Scholar 

  5. Celano, G., Costa, A., Fichera, S.: An evolutionary algorithm for pure fuzzy flowshop scheduling problems. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 11, 655–669 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fortemps, P.: Jobshop scheduling with imprecise durations: a fuzzy approach. IEEE Transactions of Fuzzy Systems 7, 557–569 (1997)

    Article  Google Scholar 

  7. Lin, F.T.: Fuzzy job-shop scheduling based on ranking level (λ,1) interval-valued fuzzy numbers. IEEE Transactions on Fuzzy Systems 10(4), 510–522 (2000)

    Google Scholar 

  8. Sakawa, M., Kubota, R.: Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms. European Journal of Operational Research 120, 393–407 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fayad, C., Petrovic, S.: A fuzzy genetic algorithm for real-world job shop scheduling. In: Ali, M., Esposito, F. (eds.) IEA/AIE 2005. LNCS (LNAI), vol. 3533, pp. 524–533. Springer, Heidelberg (2005)

    Google Scholar 

  10. González Rodríguez, I., Puente, J., Vela, C.R., Varela, R.: Evaluation methodology of schedules for the fuzzy job-shop problem. IEEE Transactions on Systems, Man and Cybernetics, Part A. Accepted for publication

    Google Scholar 

  11. Petrovic, S., Song, X.: A new approach to two-machine flow shop problem with uncertain processing times. Optimization and Engineering 7, 329–342 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  12. Ishibuchi, H., Yamamoto, N., Murata, T., Tanaka, H.: Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems. Fuzzy Sets and Systems 67, 81–100 (1994)

    Article  MathSciNet  Google Scholar 

  13. Song, X., Petrovic, S.: Handling fuzzy constraints in flow shop problem. In: De Baets, B., Fodor, J., Radojevic, D. (eds.) Proceedings of the 9th Meeting of the EURO Working Group on Fuzzy Sets, EUROFUSE2005, pp. 235–244 (2005)

    Google Scholar 

  14. González, N., Vela, C.R.: Un algoritmo metaheurístico para la resolución de problemas p// ∑ c i . In: Actas del IV Congreso Español sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados (MAEB’2005), pp. 449–456 (2005)

    Google Scholar 

  15. Bortolan, G., Degani, R.: A review of some methods for ranking fuzzy subsets. In: Dubois, D., Prade, H., Yager, R. (eds.) Readings in Fuzzy Sets for Intelligence Systems, pp. 149–158. Morgan Kaufmann, Amsterdam (1993)

    Google Scholar 

  16. Framinan, J., Gupta, J., Leisten, R.: A review and classification heuristics for permutation flow shop scheduling with makespan objective. Journal of the Operational Research Society 55, 1243–1255 (2004)

    Article  MATH  Google Scholar 

  17. Liu, J., Reeves, C.: Constructive and composite heuristic solutions to the p//∑ c i scheduling problem. European Journal of Operational Research 132, 439–452 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  18. Ho, J.: Theory and methodology, flowshop sequencing with mean flowtime objective. European Journal of Operational Research 81, 571–578 (1995)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Mira José R. Álvarez

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

González, N., Vela, C.R., González-Rodríguez, I. (2007). Comparative Study of Meta-heuristics for Solving Flow Shop Scheduling Problem Under Fuzziness. In: Mira, J., Álvarez, J.R. (eds) Bio-inspired Modeling of Cognitive Tasks. IWINAC 2007. Lecture Notes in Computer Science, vol 4527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73053-8_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73053-8_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73052-1

  • Online ISBN: 978-3-540-73053-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics