Skip to main content
SpringerLink
Log in
Book cover

International Conference on Combinatorial Optimization and Applications

COCOA 2008: Combinatorial Optimization and Applications pp 427–437Cite as

Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays

  • Conference paper

  • 784 Accesses

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

Abstract

We study the problem of minimizing total completion time in the two-machine flow shop with exact delay model. This problem is a generalization of the no-wait flow shop problem which is known to be strongly NP-hard. Our problem has many applications but little results are given in the literature so far. We focus on permutation schedules. We first prove that some simple algorithms can be used to find the optimal schedules for some special cases. Then for the general case, we design some heuristics as well as metaheuristics whose performance are shown to be very well by computational experiments.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ageev, A.A., Kononov, A.V.: Approximation Algorithms for Scheduling Problems with Exact Delays. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 1–14. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Ageev, A.A., Kononov, A.V.: Approximation Algorithms for the Single and Two- Machine Scheduling Problems with Exact Delays. Operations Research Letters 35(4), 533–540 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Adiri, I., Pohoryles, D.: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times. Naval Research Logistics Quarterly 29, 495–504 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chen, C.L., Neppalli, R.V., Aljaber, N.: Genetic algorithms applied to the continuous flow shop problem. Computers and Industrial Engineering 30, 919–929 (1996)

    Article  Google Scholar 

  5. Fink, A., Voß, S.: Solving the continuous flow-shop scheduling problem by mata- heuristics. European Journal of Operational Research 151, 400–414 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Glover, F.: Tabu Search - Part II. ORSA J. on Comp. 2, 4–32 (1990)

    MATH  Google Scholar 

  7. Gonzales, T.: Unit Execution Time Shop Problems. Mathematics of Operations Research 7, 57–66 (1982)

    Article  MathSciNet  Google Scholar 

  8. Grham, R.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequence and scheduling: A survey. Annals of Discrete Math. 5, 287–326 (1979)

    Article  Google Scholar 

  9. Gupta, J.N.D.: Optimal flowshop schedules with no intermediate storage space. Naval Research Logistics Quarterly 23, 235–243 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  10. Leung, J.Y.-T., Li, H., Zhao, H.: Scheduling Two-Machine Flow Shops with Exact Delay. International Journal of Foundations of Computer Science 18(2), 341–360 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  11. Papadimitriou, C.H., Kanellakis, P.C.: Flowshop scheduling with limited temporary storage. Journal of the ACM 27, 533–549 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  12. Rajendran, C., Chaudhuri, D.: Heursitic algorithms for coninuos flow-shop problem. Naval Research Logistics 37, 695–705 (1990)

    Article  MATH  Google Scholar 

  13. Röck, H.: Some new results in flow shop scheduling. Mathematical Methods of Operations Research (ZOR) 28(1), 1–16 (1984)

    MATH  Google Scholar 

  14. Sriskandarajah, C., Ladet, P.: Some No-wait Shops Scheduling Problems: Complexity Aspects. European Journal of Operational Research 24(3), 424–438 (1986)

    Article  MathSciNet  Google Scholar 

  15. Szwarc, W.: A note on the fflow-shop problem without interruptions in job processing. Naval Research Logistics Quarterly 28, 665–669 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  16. Van der Veen, J.A.A., van Dal, R.: Solvable cases of the no-wait flow-shop scheduling problem. Journal of the Oper. Res. Society 42, 971–980 (1991)

    MATH  Google Scholar 

  17. Van Deman, J.M., Baker, K.R.: Minimizing mean flowtime in the flow shop with no intermediate queues. AIIE Transactions 6, 28–34 (1974)

    Google Scholar 

  18. Yu, W., Hoogeveen, H., Lenstra, J.K.: Minimizing makespan in a two-machine flow shop with delays and unit- time operations is NP-hard. Journal of Scheduling 7, 333–348 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, College of Staten Island, CUNY, 2800 Victory Blvd 1N-215, Staten Island, New York, 10314

    Yumei Huo

  2. Lehman Brothers Inc., New York City, NY 10019, USA

    Haibing Li

  3. Department of Mathematics, Computer Science & Statistics, Purdue University Calumet, 2200 169th Street, Hammond, IN 46323

    Hairong Zhao

Authors
  1. Yumei Huo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haibing Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hairong Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Boting Yang Ding-Zhu Du Cao An Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huo, Y., Li, H., Zhao, H. (2008). Minimizing Total Completion Time in Two-Machine Flow Shops with Exact Delays. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85097-7_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85096-0

  • Online ISBN: 978-3-540-85097-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation