Skip to main content
SpringerLink
Log in

New Heuristics for No-Wait Flowshop Scheduling with Precedence Constraints and Sequence Dependent Setup Time

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

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

Included in the following conference series:

Abstract

This paper addresses a method to obtain the best sequence for no-wait flowshop scheduling with precedence constraints and sequence dependent setup time. The system is made up of a set of machines of various types and there is no interruption between tasks in a job. The objective is to determine the job sequence for processing with minimum makespan. The sequencing problem with precedence constraints and sequence dependent setup times is equivalent to the traveling salesman problem. A mixed integer programming (MIP) model is presented to obtain the best schedule. It is known that the MIP model for no-wait flowshop scheduling is NP-hard. Heuristic algorithms to gain the best job sequence are developed. From the experiments, it is found that the proposed algorithm generates the best job sequence efficiently.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Aldowaisan, T., Allahverdi, A.: New Heuristics for No-wait Flowshops to Minimize Makespan. Comput. Oper. Res 30, 1219–1231 (2003)

    Article  MATH  Google Scholar 

  2. Emmons, H., Mathur, K.: Lot Sizing in a No-wait Flowshop. Oper. Res. Lett. 17, 159–164 (1995)

    Article  MATH  Google Scholar 

  3. Gangadharan, R., Rajendran, C.: Heuristic Algorithms for Scheduling in the Nowait Flow-shop. Int. J. Prod. Econ. 32, 285–290 (1993)

    Article  Google Scholar 

  4. Hung, Y.F., Chien, K.L.: A Multi-class Multi-level Capacitated Lot Sizing Model. J. Oper. Res. Soc. 51, 1309–1318 (2000)

    MATH  Google Scholar 

  5. Lee, J.K., Kim, Y.D.: Search Heuristics for Resource Constrained Project Scheduling. J. Oper. Res. Soc. 47, 678–689 (1996)

    MATH  Google Scholar 

  6. Lin, B.M.T., Cheng, T.C.E.: Batch Scheduling in the No-wait Two-machine Flowshop to Minimize the Makespan. Comput. Oper. Res. 28, 613–624 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ogbu, F.A., Smith, D.K.: The Application of the Simulated Annealing Algorithm to the Solution of the n/m/Cmax Flowshop Problem. Comput. Oper. Res. 17, 243–253 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Rajendran, C.: A No-wait Flowshop Scheduling Heuristic to Minimize Makespan. J. Oper. Res. Soc. 45, 472–478 (1994)

    MATH  Google Scholar 

  9. Röck, H.: The Three-machine No-wait Flow Shop is NP-complete. J. ACM. 31, 336–345 (1984)

    Article  MATH  Google Scholar 

  10. Wang, G., Cheng, T.C.E.: Heuristics for Two-machine No-wait Flowshop Scheduling with an Availability Constraint. Inform. Process. Lett. 80, 305–309 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Hanyang University, Sa 1 Dong, Ansan, Gyeonggi-Do, 426-791, Korea

    Young Hae Lee

  2. Department of Industrial Engineering, Hanyang University, Sa 1 Dong, Ansan, Gyeonggi-Do, 426-791, Korea

    Jung Woo Jung

Authors
  1. Young Hae Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jung Woo Jung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, Y.H., Jung, J.W. (2005). New Heuristics for No-Wait Flowshop Scheduling with Precedence Constraints and Sequence Dependent Setup Time. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_50

Download citation

  • DOI: https://doi.org/10.1007/11424925_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25863-6

  • Online ISBN: 978-3-540-32309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation