Document Open Access Logo

Approximation Algorithms for Generalized Path Scheduling

Authors Haozhou Pang, Mohammad R. Salavatipour

PDF
Thumbnail PDF

File

LIPIcs.ISAAC.2020.10.pdf
  • Filesize: 0.53 MB
  • 16 pages

Document Identifiers

Author Details

Haozhou Pang
  • Department of Computer Science, University of Alberta, Edmonton, Canada
Mohammad R. Salavatipour
  • Department of Computer Science, University of Alberta, Edmonton, Canada

Funding

  • Pang, Haozhou: Supported by NSERC and Department of Computing Science at University of Alberta.
  • Salavatipour, Mohammad R.: Supported by NSERC.

Cite AsGet BibTex

Haozhou Pang and Mohammad R. Salavatipour. Approximation Algorithms for Generalized Path Scheduling. In 31st International Symposium on Algorithms and Computation (ISAAC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 181, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.ISAAC.2020.10

Abstract

Scheduling problems where the machines can be represented as the edges of a network and each job needs to be processed by a sequence of machines that form a path in this network have been the subject of many research articles (e.g. flow shop is the special case where the network as well as the sequence of machines for each job is a simple path). In this paper we consider one such problem, called Generalized Path Scheduling (GPS) problem, which can be defined as follows. Given a set of non-preemptive jobs J and identical machines M ( |J| = n and |M| = m ). The machines are ordered on a path. Each job j = {P_j = {l_j, r_j}, p_j} is defined by its processing time p_j and a sub-path P_j from machine with index l_j to r_j (l_j, r_j ∈ M, and l_j ≤ r_j) specifying the order of machines it must go through. We assume each machine has a queue of infinite size where jobs can sit in the queue to resolve conflicts. Two objective functions, makespan and total completion time, are considered. Machines can be identical or unrelated. In the latter case, this problem generalizes the classical Flow shop problem (in which all jobs have to go through all machines from 1 to m in that order). Generalized Path Scheduling has been studied (e.g. see [Ronald Koch et al., 2009; Zachary Friggstad et al., 2019]). In this paper, we present several improved approximation algorithms for both objectives. For the case of number of machines being sub-logarithmic in the number of jobs we present a PTAS for both makespan and total completion time. The PTAS holds even on unrelated machines setting and therefore, generalizes the result of Hall [Leslie A. Hall, 1998] for the classic problem of Flow shop. For the case of identical machines, we present an O((log m)/(log log m))-approximation algorithms for both objectives, which improve the previous best result of [Zachary Friggstad et al., 2019]. We also show that the GPS problem is NP-complete for both makespan and total completion time objectives.

Subject Classification

ACM Subject Classification
  • Theory of computation → Scheduling algorithms
Keywords
  • Approximation Algorithms
  • Path Scheduling
  • Flow shop
  • Job Shop

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Antonios Antoniadis, Neal Barcelo, Daniel Cole, Kyle Fox, Benjamin Moseley, Michael Nugent, and Kirk Pruhs. Packet forwarding algorithms in a line network. In Alberto Pardo and Alfredo Viola, editors, LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, volume 8392 of Lecture Notes in Computer Science, pages 610-621. Springer, 2014. URL: https://doi.org/10.1007/978-3-642-54423-1_53.
  2. Kamalika Chaudhuri, Brighten Godfrey, Satish Rao, and Kunal Talwar. Paths, trees, and minimum latency tours. In 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pages 36-45. IEEE Computer Society, 2003. URL: https://doi.org/10.1109/SFCS.2003.1238179.
  3. Uriel Feige and Christian Scheideler. Improved bounds for acyclic job shop scheduling (extended abstract). In Jeffrey Scott Vitter, editor, Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998, pages 624-633. ACM, 1998. URL: https://doi.org/10.1145/276698.276878.
  4. Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, and Yifeng Zhang. Scheduling problems over a network of machines. J. Sched., 22(2):239-253, 2019. URL: https://doi.org/10.1007/s10951-018-0591-z.
  5. Iftah Gamzu and Danny Segev. A polynomial-time approximation scheme for the airplane refueling problem. J. Sched., 22(1):119-135, 2019. URL: https://doi.org/10.1007/s10951-018-0569-x.
  6. Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, and Elizabeth Sweedyk. Better approximation guarantees for job-shop scheduling. SIAM J. Discret. Math., 14(1):67-92, 2001. URL: https://doi.org/10.1137/S0895480199326104.
  7. Leslie A. Hall. Approximability of flow shop scheduling. Math. Program., 82:175-190, 1998. URL: https://doi.org/10.1007/BF01585870.
  8. David G. Harris and Aravind Srinivasan. Constraint satisfaction, packet routing, and the lovasz local lemma. In Dan Boneh, Tim Roughgarden, and Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, pages 685-694. ACM, 2013. URL: https://doi.org/10.1145/2488608.2488696.
  9. Ronald Koch, Britta Peis, Martin Skutella, and Andreas Wiese. Real-time message routing and scheduling. In Irit Dinur, Klaus Jansen, Joseph Naor, and José D. P. Rolim, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, volume 5687 of Lecture Notes in Computer Science, pages 217-230. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-03685-9_17.
  10. Dariusz R. Kowalski, Eyal Nussbaum, Michael Segal, and Vitaly Milyeykovski. Scheduling problems in transportation networks of line topology. Optimization Letters, 8(2):777-799, 2014. URL: https://doi.org/10.1007/s11590-013-0613-x.
  11. Dariusz R. Kowalski, Zeev Nutov, and Michael Segal. Scheduling of vehicles in transportation networks. In Alexey V. Vinel, Rashid Mehmood, Marion Berbineau, Cristina Rico Garcia, Chung-Ming Huang, and Naveen Chilamkurti, editors, Communication Technologies for Vehicles - 4th International Workshop, Nets4Cars/Nets4Trains 2012, Vilnius, Lithuania, April 25-27, 2012. Proceedings, volume 7266 of Lecture Notes in Computer Science, pages 124-136. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-29667-3_11.
  12. Frank Thomson Leighton, Bruce M. Maggs, and Satish Rao. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica, 14(2):167-186, 1994. URL: https://doi.org/10.1007/BF01215349.
  13. Frank Thomson Leighton, Bruce M. Maggs, and Andréa W. Richa. Fast algorithms for finding o(congestion + dilation) packet routing schedules. Combinatorica, 19(3):375-401, 1999. URL: https://doi.org/10.1007/s004930050061.
  14. Wenhua Li, Maurice Queyranne, Maxim Sviridenko, and Jinjiang Yuan. Approximation algorithms for shop scheduling problems with minsum objective: A correction. J. Sched., 9(6):569-570, 2006. URL: https://doi.org/10.1007/s10951-006-8790-4.
  15. Sergey V. Sevastianov and Gerhard J. Woeginger. Makespan minimization in open shops: A polynomial time approximation scheme. Math. Program., 82:191-198, 1998. URL: https://doi.org/10.1007/BF01585871.
  16. Natalia Shakhlevich, Han Hoogeveen, and Michael Pinedo. Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling, 1998. Google Scholar
  17. David B. Shmoys, Clifford Stein, and Joel Wein. Improved approximation algorithms for shop scheduling problems. SIAM J. Comput., 23(3):617-632, 1994. URL: https://doi.org/10.1137/S009753979222676X.
  18. René Sitters. Polynomial time approximation schemes for the traveling repairman and other minimum latency problems. In Chandra Chekuri, editor, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 604-616. SIAM, 2014. URL: https://doi.org/10.1137/1.9781611973402.46.
  19. René Sitters and Liya Yang. A dollar(2 + ε)dollar-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective. CoRR, abs/1706.07604, 2017. URL: http://arxiv.org/abs/1706.07604.
  20. Pravin M. Vaidya. Speeding-up linear programming using fast matrix multiplication (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pages 332-337. IEEE Computer Society, 1989. URL: https://doi.org/10.1109/SFCS.1989.63499.
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact