Skip to main content
SpringerLink
Log in

An Effective Heuristic for the No-Wait Flowshop with Sequence-Dependent Setup Times Problem

  • Conference paper
Advances in Artificial Intelligence (MICAI 2010)

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

Included in the following conference series:

Abstract

This paper presents a new constructive heuristic named GAPH based on a structural property for the m-machine no-wait flowshop with sequencedependent setup times with makespan as the criterion. Experimental results demonstrate the superiority of the proposed approach over three of the bestknow methods in the literature. Experimental and statistical analyses show that the new heuristic proposed provides better solutions regarding the solution quality and the computational effort.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y.: A survey of scheduling problems with setups times or costs. Eur. J. Oper. Res. 187, 985–1032 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Allahverdi, A., Soroush, H.M.: The significance of reducing setup times/setup costs. Eur. J. Oper. Res. 187, 978–984 (2008)

    Article  MATH  Google Scholar 

  3. Aldowaisan, T.: A new heuristic and dominance relations for no-wait flowshops with setups. Comp. Oper. Res. 28, 563–584 (2001)

    Article  MATH  Google Scholar 

  4. Hall, N.G., Sriskandarajah, C.: A survey of Machine Scheduling Problems with Blocking and No-Wait in Process. Oper. Res. 44, 510–525 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bianco, L., Dell’Olmo, P., Giordani, S.: Flow shop no-wait scheduling with sequence-dependent setup times and release dates. Infor. J. 37, 3–19 (1999)

    Google Scholar 

  6. Brown, S.I., Mcgarvey, R., Ventura, J.A.: Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated. J. Oper. Res. Soc. 55, 614–621 (2004)

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  8. Ruiz, R., Maroto, C., Alcaraz, J.: Solving the flowshop scheduling problem with sequence-dependent setup times using advanced metaheuristics. Eur. J. Oper. Res. 165, 34–54 (2005)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering, School of Engineering of São Carlos, University of São Paulo, Av. Trabalhador São-Carlense 400, 13566-590, São Carlos, São Paulo, Brazil

    Daniella Castro Araújo & Marcelo Seido Nagano

Authors
  1. Daniella Castro Araújo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcelo Seido Nagano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Instituto Politécnico Nacional, Centro de Investigación en Computación, Av. Juan Dios Batiz, s/n, Zacatenco, 07738, Mexico City, México

    Grigori Sidorov

  2. Area de Computación, Centro de Investigación en Matemáticas (CIMAT), Callejón de Jalisco s/n, Mineral de Valenciana, 36240, Guanajuato, México

    Arturo Hernández Aguirre

  3. Instituto Nacional de Astrofísica, Optica y Electrónica (INAOE), Ciencias Computacionales, Luis Enrique Erro No. 1, 72840, Santa María Tonantzintla, Puebla,, México

    Carlos Alberto Reyes García

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Castro Araújo, D., Seido Nagano, M. (2010). An Effective Heuristic for the No-Wait Flowshop with Sequence-Dependent Setup Times Problem. In: Sidorov, G., Hernández Aguirre, A., Reyes García, C.A. (eds) Advances in Artificial Intelligence. MICAI 2010. Lecture Notes in Computer Science(), vol 6437. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16761-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16761-4_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16760-7

  • Online ISBN: 978-3-642-16761-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation