Advertisement

On Approximation Algorithms for Two-Stage Scheduling Problems

  • Guangwei Wu
  • Jianer Chen
  • Jianxin WangEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10336)

Abstract

We study scheduling on parallel two-stage flowshops in which each job has to pass through two operations: an R-operation and a T-operation. Motivated by the current research in data centers, we consider two restricted versions of the problem: one restricts that for each job, the R-operation consumes no less time than the T-operation, while the other assumes that the T-operation takes more time than the R-operation for each job. For the first case, we present an online 2-competitive algorithm and an offline 11/6-approximation algorithm. For the second case, we give an online 5/2-competitive algorithm, and prove, for the offline setting, that the problem can be reduced to the problem in the first case.

Keywords

Completion Time Approximation Ratio Competitive Ratio Online Algorithm Online Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Abts, D., Felderman, B.: A guided tour through data-center networking. Queue 10(5), 10–23 (2012)CrossRefGoogle Scholar
  2. 2.
    Albers, S.: Better bounds for online scheduling. SIAM J. Comput. 29(2), 459–473 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Barroso, L.A., Clidaras, J., Hölzle, U.: The datacenter as a computer: an introduction to the design of warehouse-scale machines. Synth. Lect. Comput. Archit. 8(3), 1–154 (2013)CrossRefGoogle Scholar
  4. 4.
    Bartal, Y., Fiat, A., Karloff, H., Vohra, R.: New algorithms for an ancient scheduling problem. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 51–58. ACM (1992)Google Scholar
  5. 5.
    Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York (2005)zbMATHGoogle Scholar
  6. 6.
    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)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Galambos, G., Woeginger, G.J.: An on-line scheduling heuristic with better worst-case ratio than Graham’s list scheduling. SIAM J. Comput. 22(2), 349–355 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    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)zbMATHGoogle Scholar
  9. 9.
    Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563–1581 (1966)CrossRefzbMATHGoogle Scholar
  10. 10.
    Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416–429 (1969)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5(1), 287–326 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    He, D.W., Kusiak, A., Artiba, A.: A scheduling problem in glass manufacturing. IIE Trans. 28(2), 129–139 (1996)CrossRefGoogle Scholar
  13. 13.
    Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer Science, New York (2016)CrossRefzbMATHGoogle Scholar
  14. 14.
    Tong, W., Miyano, E., Goebel, R., Lin, G.: A PTAS for the multiple parallel identical multi-stage flow-shops to minimize the makespan. In: Zhu, D., Bereg, S. (eds.) FAW 2016. LNCS, vol. 9711, pp. 227–237. Springer, Cham (2016). doi: 10.1007/978-3-319-39817-4_22 Google Scholar
  15. 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. 16.
    Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, New York (2011)CrossRefzbMATHGoogle Scholar
  17. 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. 18.
    Zhang, X., van de Velde, S.: Approximation algorithms for the parallel flow shop problem. Eur. J. Oper. Res. 216(3), 544–552 (2012)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.School of Information Science and EngineeringCentral South UniversityChangshaPeople’s Republic of China
  2. 2.College of Computer and Information EngineeringCentral South University of Forestry and TechnologyChangshaPeople’s Republic of China
  3. 3.Department of Computer Science and EngineeringTexas A&M UniversityCollege StationUSA

Personalised recommendations