Skip to main content
SpringerLink
Log in
SpringerLink
Log in

An Estimation of Distribution Algorithm for Minimizing the Makespan in Blocking Flowshop Scheduling Problems

  • Chapter
Computational Intelligence in Flow Shop and Job Shop Scheduling

Part of the book series: Studies in Computational Intelligence ((SCI,volume 230))

Summary

This chapter addresses to the blocking flowshop scheduling problem with the aim of minimizing the makespan. An Estimation of Distribution Algorithm, followed by a local search procedure, after the step of creating a new individual, was developed in order to solve this problem. Our comparisons were performed against representative approaches proposed in the literature related to the blocking flowshop scheduling problem. The obtained results have shown that the proposed algorithm is able to improve 109 out of 120 best known solutions of Taillard’s instances. Moreover, our algorithm outperforms all competing approaches in terms of solution quality and computational time.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Abadi, I.N.K., Hall, N.G., Sriskandarajah, C.: Minimizing cycle time in a blocking flowshop. Operations Research 48, 177–180 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  • Back, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, Oxford (1996)

    Google Scholar 

  • Baluja, S.: Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning, Technical Report, Carnegie Mellon Report, CMU-CS: 94-163 (1994)

    Google Scholar 

  • Baluja, S., Davies, S.: Using optimal dependency trees for combinatorial optimization: Learning the structure of search space. Technical Report No. CMU-CS-97-107, Carnegie Mellon University, Pittsburgh, Pennsylvania (1997)

    Google Scholar 

  • Caraffa, V., Ianes, S., Bagchi, T.P., Sriskandarajah, C.: Minimizing makespan in a blocking flowshop using genetic algorithms. International Journal of Production Economics 70, 101–115 (2001)

    Article  Google Scholar 

  • Companys, R., Mateo, M.: Different behaviour of a double branch-and-bound algorithm on Fm|prmu|Cmax and Fm|block|Cmax problems. Computers and Operations Research 34, 938–953 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  • DeBonet, J.S., Isbell, C.L., Viola, P.: MIMIC: Finding optima by estimating probability densities. In: Mozer, M., Jordan, M., Petsche, T. (eds.) Advances in Neural Information Processing Systems, vol. 9 (1997)

    Google Scholar 

  • Fogel, D.B.: Evolutionary Computation. In: Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway (1995)

    Google Scholar 

  • Grabowski, J., Pempera, J.: Sequencing of jobs in some production system. European Journal of Operational Research 125, 535–550 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  • Grabowski, J., Pempera, J.: The permutation flow shop problem with blocking. A tabu search approach. OMEGA The International Journal of Management Science 35, 302–311 (2007)

    Article  Google Scholar 

  • Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5, 287–326 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  • Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44, 510–525 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  • Harik, G., Lobo, F.G., Golberg, D.E.: The compact genetic algorithm. In: Proceedings of the IEEE Conference on Evolutionary Computation, pp. 523–528 (1998)

    Google Scholar 

  • Li, H., Zhang, Q., Tsang, E., Ford, J.A.: Hybrid Estimation of Distribution Algorithm for Multi-objective Knapsack Problem. In: The 4th European Conference on Evolutionary Computation in Combinatorial Optimization, Coimbra, Portugal, 5-7 April (2004)

    Google Scholar 

  • Larrañaga, P., Etxeberria, R., Lozano, J.A., Pena, J.M.: Combinatorial Optimization by learning and simulation of Bayesian networks. In: Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, Stanford, pp. 343–352 (2000)

    Google Scholar 

  • Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms. In: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  • Leistein, R.: Flowshop sequencing with limited buffer storage. International Journal of Production Research 28, 2085–2100 (1990)

    Article  Google Scholar 

  • Levner, E.M.: Optimal Planning of Parts Machining on a Number of Machines. Automation and Remote Control 12, 1972–1978 (1969)

    MathSciNet  Google Scholar 

  • Lozano, J., Larraanaga, P., Inza, I., Bengoetxea, E.: Towards a New Evolutionary Computation: Advances in the Estimation of Distribution Algorithms. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  • Lozano, J.A., Mendiburu, A.: EDAs applied to the job shop scheduling problem. In: Lozano, J.A., Larraanaga, P., Inza, I., Bengoetxea, E. (eds.) Towards a New Evolutionary Computation: Advances in the Estimation of Distribution Algorithms, pp. 231–240. Springer, Heidelberg (2002)

    Google Scholar 

  • McCormick, S.T., Pinedo, M.L., Shenker, S., Wolf, B.: Sequencing in an assembly line with blocking to minimize cycle time. Operations Research 37, 925–935 (1989)

    Article  MATH  Google Scholar 

  • Mühlenbein, H.: The equation for response to selection and its use for prediction. Evolut. Comput. 5, 303–346 (1998)

    Article  Google Scholar 

  • Mühlenbein, H., Mahnig, T.: The Factorized Distribution Algorithm for additively decomposed functions. In: Proceedings of the 1999 Congress on Evolutionary Computation, pp. 752–759. IEEE press, Los Alamitos (1999)

    Chapter  Google Scholar 

  • Mühlenbein, H., Paaß, G.: From Recombination of Genes to the Estimation of Distributions I. Binary Parameters. PPSN, 178–187 (1996)

    Google Scholar 

  • Nawaz, M., Enscore Jr., E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA The International Journal of Management Science 11, 91–95 (1983)

    Article  Google Scholar 

  • Paul, T.K., Iba, H.: Linear and Combinatorial Optimizations by estimation of Distribution Algorithms. In: 9th MPS Symposium on Evolutionary Computation, IPSJ, Japan (2002)

    Google Scholar 

  • Pelikan, M., Mühlenbein, H.: The bivariate marginal distribution algorithm. In: Roy, R., Furuhashi, T., Chandhory, P.K. (eds.) Advances in Soft Computing-Engineering Design and Manufacturing, pp. 521–535. Springer, Heidelberg (1999)

    Google Scholar 

  • Pelikan, M., Goldberg, D.E., Cantpaz, E.: Linkage Problem, Distribution Estimation and Bayesian Networks. Evolutionary Computation 8(3), 311–340 (2000)

    Article  Google Scholar 

  • Reeves, C.R.: A genetic algorithm for flowshop sequencing. Computers and Operations Research 22, 5–13 (1995)

    Article  MATH  Google Scholar 

  • Ronconi, D.P.: A note on constructive heuristics for the flowshop problem with blocking. International Journal of Production Economics 87, 39–48 (2004)

    Article  Google Scholar 

  • Ronconi, D.P.: A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking. Annals of Operations Research 138, 53–65 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  • Ronconi, D.P., Armentano, V.A.: Lower bounding schemes for flowshops with blocking in-process. Journal of the Operational Research Society 52, 1289–1297 (2001)

    Article  MATH  Google Scholar 

  • Salhi, A., Rodriguez, J.A.V., Zhang, Q.: An Estimation of Distribution Algorithm with Guided Mutation for a Complex Flow Shop Scheduling Problem GECCO 2007, London, England, United Kingdom, July 7–11 (2007)

    Google Scholar 

  • Suhami, I., Mah, R.S.H.: An Implicit Enumeration Scheme for the Flowshop Problem with No Intermediate Storage. Computers and Chemical Engineering 5, 83–91 (1981)

    Article  Google Scholar 

  • Syswerda, G.: Simulated crossover in genetic algorithms. In: Foundations of Genetic Algorithms, vol. 2, pp. 239–255. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  • Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)

    Article  MATH  Google Scholar 

  • Zhang, Q., Sun, J., Tsang, E.P.K., Ford, J.: Estimation of Distribution Algorithm with 2-opt Local Search for the Quadratic Assignment Problem. to be appeared in a book on Estimation of Distribution Algorithm. In: Lozano, J., Larraanaga, P., Inza, I., Bengoetxea, E. (eds.) Towards a New Evolutionary Computation: Advances in the Estimation of Distribution Algorithms, pp. 281–291. Springer, Heidelberg (2006)

    Google Scholar 

  • Zhang, Q., Zhou, A., Jin, Y.: RM-MEDA: A Regularity Model Based Multiobjective Estimation of Distribution Algorithm. IEEE Trans. Evolutionary Computation 12, 41–63 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FSEGS Email:eddaly.mansour@gmail, route de l’aéroport km 4.5, B.P. No. 1088, Sfax 3018, Tunisie

    Bassem Jarboui, Mansour Eddaly & Abdelwaheb Rebaï

  2. LiSSi, Université de Paris 12, 61 avenue du Général de Gaulle, 94010, Créteil, France

    Patrick Siarry

Authors
  1. Bassem Jarboui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mansour Eddaly
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Patrick Siarry
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Abdelwaheb Rebaï
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematics & Computer Science Department, University of Missouri, 63121, Saint Louis, MO, USA

    Uday K. Chakraborty

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jarboui, B., Eddaly, M., Siarry, P., Rebaï, A. (2009). An Estimation of Distribution Algorithm for Minimizing the Makespan in Blocking Flowshop Scheduling Problems. In: Chakraborty, U.K. (eds) Computational Intelligence in Flow Shop and Job Shop Scheduling. Studies in Computational Intelligence, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02836-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02836-6_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02835-9

  • Online ISBN: 978-3-642-02836-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation