Skip to main content

Scheduling a Fuzzy Flowshop Problem with Flexible Due Dates Using Ant Colony Optimization

  • Conference paper
Applications of Evolutionary Computing (EvoWorkshops 2007)

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

Included in the following conference series:

Abstract

Most of the work about flowshop scheduling problems assume that the problem data are known exactly at the advance or the common approach to the treatment of the uncertainties in the problem is use of probabilistic models. However, the evaluation and optimization of the probabilistic model is computationally expensive and rational only when the descriptions of the uncertain parameters are available from the historical data. In addition, a certain amount of delay on due dates may be tolerated in most real-world situations although they are handled as crisp dates in most of the previous papers. In this paper we deal with a flowshop scheduling problem with fuzzy processing times and flexible due dates. Schedules are generated by a proposed algorithm in the context of ant colony optimization metaheuristic approach.

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. Rinnooy-Kan, A.H.G.: Machine scheduling problems: Classification, complexity and computations. Hagues: Martinus Nijhoff (1976)

    Google Scholar 

  2. Fortemps, P.: Introducing flexibility in scheduling: The preference approach. In: Slowinski, R., Hapke, M. (eds.) Scheduling Under Fuzziness, pp. 61–79. Physica Verlag, Heidelberg New York (2000)

    Google Scholar 

  3. McCahon, C.S., Lee, E.S.: Fuzzy job sequencing for a flow shop. European Journal of Operational Research 62, 294–301 (1992)

    Article  MATH  Google Scholar 

  4. Ishibuchi, H., Murata, T., Lee, K.H.: Formulation of fuzzy flowshop scheduling problems with fuzzy processing time. In: Proceedings of the 15th IEEE Int. Conf. on Fuzzy Systems. New Orleans (1996)

    Google Scholar 

  5. Balasubramanian, J., Grossmann, I.E.: Scheduling optimization under uncertainty – an alternative approach. Computers and Chemical Engineering 27, 469–490 (2003)

    Article  Google Scholar 

  6. 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  MathSciNet  MATH  Google Scholar 

  7. Fortemps, P., Roubens, M.: Ranking and defuzzification methods based on area compensation. Fuzzy Sets and Systems 82, 319–330 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Massachusetts, London (2004)

    MATH  Google Scholar 

  9. Stützle, T., Hoos, H.H.: MAX-MIN Ant System. Future Generation Computer Systems 16, 889–914 (2000)

    Article  MATH  Google Scholar 

  10. Balasubramanian, J., Grossmann, I.E.: Scheduling optimization under uncertainty – an alternative approach. Computers and Chemical Engineering 27, 469–490 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kilic, S. (2007). Scheduling a Fuzzy Flowshop Problem with Flexible Due Dates Using Ant Colony Optimization. In: Giacobini, M. (eds) Applications of Evolutionary Computing. EvoWorkshops 2007. Lecture Notes in Computer Science, vol 4448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71805-5_80

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71805-5_80

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71804-8

  • Online ISBN: 978-3-540-71805-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics