Skip to main content
SpringerLink
Log in

Approximation Algorithms for Scheduling Multiple Two-Stage Flowshops

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2017)

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

Included in the following conference series:

Abstract

This paper studies the problem that schedules n two-stage jobs on m multiple two-stage flowshops, with the objective of minimizing the makespan. The problem is NP-hard even when m is a fixed constant, and becomes strongly NP-hard when m is a part of input. A 17/6-approximation algorithm along with its analysis is presented for arbitrary \(m \ge 2\). This is the first approximation algorithm for multiple flowshops when the number m of flowshops is a part of input. The arbitrary m and the time complexity \(O(n \log n + m n)\) of the algorithm demonstrate that the problem, which plays an important role in the current research in cloud computing and data centers, can be solved efficiently with a reasonable level of satisfaction.

This work is supported by the National Natural Science Foundation of China under grants 61420106009, 61672536, 61232001, and 61472449, Scientific Research Fund of Hunan Provincial Education Department under grant 16C1660.

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 EPUB and 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

References

  1. Abts, D., Felderman, B.: A guided tour through data-center networking. Queue 10(5), 10 (2012)

    Article  Google Scholar 

  2. Dell. http://www.dell.com/us/business/p/servers

  3. Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R., Konwinski, A., Lee, G., Patterson, D., Rabkin, A., Stoica, I., et al.: A view of cloud computing. Commun. ACM 53(4), 50–58 (2010)

    Article  Google Scholar 

  4. Dong, J., Tong, W., Luo, T., Wang, X., Hu, J., Xu, Y., Lin, G.: An FPTAS for the parallel two-stage flowshop problem. Theoret. Comput. Sci. 657, 64–72 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  6. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Labs Tech. J. 45(9), 1563–1581 (1966)

    Article  MATH  Google Scholar 

  7. Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416–429 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  8. Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  9. Greenberg, A., Hamilton, J., Maltz, D.A., Patel, P.: The cost of a cloud: research problems in data center networks. ACM SIGCOMM Comput. Commun. Rev. 39(1), 68–73 (2008)

    Article  Google Scholar 

  10. He, D.W., Kusiak, A., Artiba, A.: A scheduling problem in glass manufacturing. IIE Trans. 28(2), 129–139 (1996)

    Article  Google Scholar 

  11. Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM (JACM) 34(1), 144–162 (1987)

    Article  MathSciNet  Google Scholar 

  12. Johnson, S.M.: Optimal two-and three-stage production schedules with setup times included. Nav. Res. Logist. (NRL) 1(1), 61–68 (1954)

    Article  MATH  Google Scholar 

  13. Li, H., Ghodsi, A., Zaharia, M., Shenker, S., Stoica, I.: Tachyon: reliable, memory speed storage for cluster computing frameworks. In: Proceedings of the ACM Symposium on Cloud Computing, pp. 1–15. ACM (2014)

    Google Scholar 

  14. Sahni, S.K.: Algorithms for scheduling independent tasks. J. ACM (JACM) 23(1), 116–127 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  15. Vairaktarakis, G., Elhafsi, M.: The use of flowlines to simplify routing complexity in two-stage flowshops. IIE Trans. 32(8), 687–699 (2000)

    Google Scholar 

  16. Vazirani, V.V.: Approximation Algorithms. Springer Science & Business Media, New york (2013)

    Google Scholar 

  17. Wu, G., Chen, J., Wang, J.: On scheduling two-stage jobs on multiple two-stage flowshops. Technical report, School of Information Science and Engineering Central South University (2016)

    Google Scholar 

  18. Wu, G., Chen, J., Wang, J.: On approximation algorithms for two-stage scheduling problems. In: Xiao, M., Rosamond, F. (eds.) Frontiers in Algorithmics, FAW 2017. LNCS, vol. 10336, pp. 241–253. Springer, Cham (2017)

    Google Scholar 

  19. Zhang, X., van de Velde, S.: Approximation algorithms for the parallel flow shop problem. Eur. J. Oper. Res. 216(3), 544–552 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, Changsha, People’s Republic of China

    Guangwei Wu & Jianxin Wang

  2. College of Computer and Information Engineering, Central South University of Forestry and Technology, Changsha, People’s Republic of China

    Guangwei Wu

Authors
  1. Guangwei Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianxin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianxin Wang .

Editor information

Editors and Affiliations

  1. Department of Computing, Hong Kong Polytechnic University, Hong Kong, China

    Yixin Cao

  2. Texas A&M University, College Station, Texas, USA

    Jianer Chen

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Wu, G., Wang, J. (2017). Approximation Algorithms for Scheduling Multiple Two-Stage Flowshops. In: Cao, Y., Chen, J. (eds) Computing and Combinatorics. COCOON 2017. Lecture Notes in Computer Science(), vol 10392. Springer, Cham. https://doi.org/10.1007/978-3-319-62389-4_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-62389-4_43

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-62388-7

  • Online ISBN: 978-3-319-62389-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation