Advertisement

Scheduling Three Identical Parallel Machines with Capacity Constraints

  • Jian Sun
  • Dachuan Xu
  • Ran Ma
  • Xiaoyan ZhangEmail author
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 991)

Abstract

In many flexible manufacturing systems, it is quite important to balance the number of jobs allocated to each single production facility. Yang, Ye and Zhang (2003) considered the problem that schedules n jobs on two identical parallel machines, with a capacity constraint on each machine, i.e. the number of jobs that each machine can process is bounded, so as to minimize the total weighted completion time of these jobs by semidefinite programming relaxation. In this paper, we further consider the problem of three identical parallel machines with capacity constraints and present a 1.4446-approximation algorithm based on complex semidefinite programming relaxation by extending the previous techniques.

Keywords

Approximation algorithm Parallel machine scheduling with capacity constraints Complex semidefinite programming 

References

  1. 1.
    Afrati, F., Bampis, E., Chekuri, C., Karger, D. et al.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 32–43 (1999)Google Scholar
  2. 2.
    Andersson, G.: An approximation algorithm for max \(p\)-section. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 237–247Google Scholar
  3. 3.
    Bansal, N., Srinivasan, A., Svensson, O.: Lift-and-round to improve weighted completion time on unrelated machines. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing, pp. 156–167 (2016)Google Scholar
  4. 4.
    Chekuri, C., Khanna, S.: A PTAS for minimizing weighted completion time on uniformly related machines. In: Proceedings of 28th International Colloquium on Automata, Languages, and Programming, pp. 848–861. Springer, Berlin (2001)Google Scholar
  5. 5.
    Goemans, M.X., Williamson, D.P.: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. J. Comput. Syst Sci. 68, 442–470 (2004)Google Scholar
  6. 6.
    Im, S., Li, S.: Better unrelated machine scheduling for weighted completion time via random offsets from non-uniform distributions. In: Proceedings of the 57th Annual Symposium on Foundations of Computer Science, pp. 138–147 (2016)Google Scholar
  7. 7.
    Kalaitzis, C., Svensson, O., Tarnawski, J.: Unrelated machine scheduling of jobs with uniform smith ratios. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2654–2669 (2017)Google Scholar
  8. 8.
    Shmoys, D.B., Tardos, É.: An approximation algorithm for the generalized assignment problem. Math. Program. 62(1–3), 461–474 (1993)Google Scholar
  9. 9.
    Skutella, M.: Semidefinite relaxations for parallel machine scheduling. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pp. 472–481 (1998)Google Scholar
  10. 10.
    Skutella, M.: Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM 48(2), 206–242 (2001)Google Scholar
  11. 11.
    Skutella, M., Woeginger, G.J.: A PTAS for minimizing the total weighted completion time on identical parallel machines. Math. Oper. Res. 25(1), 63–75 (2000)Google Scholar
  12. 12.
    Yang, H., Ye, Y., Zhang, J.: An approximation algorithm for scheduling two parallel machines with capacity constraints. Discret. Appl. Math. 130(3), 449–467 (2003)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Information and Operations ResearchCollege of Applied Mathematics, Beijing University of TechnologyBeijingPeople’s Republic of China
  2. 2.School of Mathematics and Information ScienceHenan Polytechnic UniversityJiaozuoPeople’s Republic of China
  3. 3.School of Mathematical Science & Institute of MathematicsNanjing Normal UniversityJiangsuPeople’s Republic of China

Personalised recommendations