Skip to main content
SpringerLink
Log in

Scheduling on Multiple Two-Stage Flowshops with a Deadline

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2021)

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

Included in the following conference series:

  • 491 Accesses

Abstract

Motivated by applications in cloud computing, we study approximation algorithms for scheduling two-stage jobs on multiple two-stage flowshops with a deadline, aiming at maximizing the profit. For the case where the number of flowshops is part of the input, we present a fast approximation algorithm with a constant ratio. The ratio is improved via a study of the relationship between the problem and the multiple knapsack problem, combined with a recently developed approximation algorithm for the multiple knapsack problem. By integrating techniques in the study of the classical Knapsack problem and the Makespan problem on multiple processors, plus additional new techniques, a polynomial-time approximation algorithm with a further improved ratio is developed for the case where the number of flowshops is a fixed constant.

This work was supported in part by the National Natural Science Foundation of China under grant 61872097.

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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. Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35(3), 713–728 (2005)

    Article  MathSciNet  Google Scholar 

  2. Chen, L., Zhang, G.: Packing groups of items into multiple knapsacks. ACM Trans. Algorithms 14(4), 1–24 (2018)

    Article  MathSciNet  Google Scholar 

  3. Dawande, M., Gavirneni, S., Rachamadugu, R.: Scheduling a two-stage flowshop under makespan constraint. Math. Comput. Model. 44, 73–84 (2006)

    Article  MathSciNet  Google Scholar 

  4. Dong, J., et al.: An FPTAS for the parallel two-stage flowshop problem. Theor. Comput. Sci. 657, 64–72 (2017)

    Article  MathSciNet  Google Scholar 

  5. Dong, J., Jin, R., Luo, T., Tong, W.: A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops. Eur. J. Oper. Res. 281, 16–24 (2020)

    Article  MathSciNet  Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  7. Jansen, K.: Parameterized approximation scheme for the multiple knapsack problem. SIAM J. Comput. 39(4), 1392–1412 (2010)

    Article  MathSciNet  Google Scholar 

  8. Jansen, K.: A fast approximation scheme for the multiple knapsack problem. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 313–324. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-27660-6_26

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  10. Kellerer, H.: A polynomial time approximation scheme for the multiple knapsack problem. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) APPROX/RANDOM -1999. LNCS, vol. 1671, pp. 51–62. Springer, Heidelberg (1999). https://doi.org/10.1007/978-3-540-48413-4_6

    Chapter  Google Scholar 

  11. Kovalyov, M.Y.: Efficient epsilon-approximation algorithm for minimizing the makespan in a parallel two-stage system. Vesti Acad. navuk Belaruskai SSR Ser. Phiz.-Mat. Navuk 3, 119 (1985). (in Russian)

    Google Scholar 

  12. Wu, G., Chen, J., Wang, J.: Scheduling two-stage jobs on multiple flowshops. Theor. Comput. Sci. 776, 117–124 (2019)

    Article  MathSciNet  Google Scholar 

  13. Wu, G., Chen, J., Wang, J.: On scheduling inclined jobs on multiple two-stage flowshops. Theor. Comput. Sci. 786, 67–77 (2019)

    Article  MathSciNet  Google Scholar 

  14. Wu, G., Chen, J., Wang, J.: Improved approximation algorithms for two-stage flowshops scheduling problem. Theor. Comput. Sci. 806, 509–515 (2020)

    Article  MathSciNet  Google Scholar 

  15. Wu, G., Chen, J., Wang, J.: On scheduling multiple two-stage flowshops. Theor. Comput. Sci. 818, 74–82 (2020)

    Article  MathSciNet  Google Scholar 

  16. 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  Google Scholar 

  17. Zhang, Y., Zhou, Y.: TransOS: a transparent computing-based operating system for the cloud. Int. J. Cloud Comut. 4(1), 287–301 (2012)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Guangzhou University, Guangzhou, 510006, People’s Republic of China

    Jianer Chen, Minjie Huang & Yin Guo

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

    Jianer Chen

Authors
  1. Jianer Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Minjie Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yin Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianer Chen .

Editor information

Editors and Affiliations

  1. The University of Texas at Dallas, Richardson, TX, USA

    Weili Wu

  2. Harbin Institute of Technology, Shenzhen, China

    Hongwei Du

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, J., Huang, M., Guo, Y. (2021). Scheduling on Multiple Two-Stage Flowshops with a Deadline. In: Wu, W., Du, H. (eds) Algorithmic Aspects in Information and Management. AAIM 2021. Lecture Notes in Computer Science(), vol 13153. Springer, Cham. https://doi.org/10.1007/978-3-030-93176-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-93176-6_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-93175-9

  • Online ISBN: 978-3-030-93176-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation