Skip to main content
SpringerLink
Log in

Scheduling Unrelated Parallel Machines Computational Results

  • Conference paper
Experimental Algorithms (WEA 2006)

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

Included in the following conference series:

Abstract

Scheduling n independent jobs on m unrelated parallel machines without preemption belongs to the most difficult scheduling problems. Here, processing job i on machine j takes time p ij , and the total time used by a machine is the sum of the processing times for the jobs assigned to it. The objective is to minimize makespan. In this paper we present an experimental study on the Unsplittable-Truemper algorithm. This purely combinatorial approach computes 2-approximate solutions in the best worst-case running time known so far. The goal of our simulations was to prove its efficiency in practice. We compare our technique with algorithms and heuristics used in practice, especially with those based on the two-step approach. The experiments show that for large and difficult instances the Unsplittable-Truemper algorithm has a clear advantage over methods based on linear programming. Moreover, it requires much less operational memory, and thus is more effective and easier to handle.

This work has been partially supported by the DFG-Sonderforschungsbereich 376 Massive Parallelität: Algorithmen, Entwurfsmethoden, Anwendungen, by the European Union within the 6th Framework Program under contract 001907 (DELIS) and by the DFG Research Training Group GK-693 of the Paderborn Institute for Scientific Computation (PaSCo).

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Operations Research 8, 101–111 (1960)

    Article  MATH  Google Scholar 

  3. Davis, E., Jaffe, J.M.: Algorithms for scheduling tasks on unrelated parallel processors. Journal of ACM 28, 721–736 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  4. Gairing, M., Lücking, T., Mavronicolas, M., Monien, B.: Computing nash equilibria for scheduling on restricted parallel links. In: Proceedings of the 36th Annual ACM Symposium on the Thoery of Computing (STOC 2004), pp. 613–622 (2004)

    Google Scholar 

  5. Gairing, M., Monien, B., Woclaw, A.: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 828–839. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Glass, P., Potts, C., Shade, P.: Unrelated parallel machine scheduling using local search. Mathematical Computing Modeling 20(2), 41–52 (1994)

    Article  MATH  Google Scholar 

  7. Graham, R.L.: Bounds for certain multiprocessor anomalies. Bell System Technical Journal 45, 1563–1581 (1966)

    Google Scholar 

  8. Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Ken, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287–326 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kleinberg, J.: Single-source unsplittable flow. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS 1996), pp. 68–77 (1996)

    Google Scholar 

  10. Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46, 259–271 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  11. Mokotoff, E., Chrétienne, P.: A cutting plane algorithm for the unrelated parallel machine scheduling problem. European Journal of Operational Research 141, 515–525 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mokotoff, E., Jimeno, J.L.: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem. Annals of Operations Research 117, 133–150 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Radzik, T.: Improving time bounds on maximum generalised flow computations by contracting the network. Theoretical Computer Science 312(1), 75–97 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Shchepin, E.V., Vakhania, N.: An optimal rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters 33, 127–133 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  15. Sourd, F.: Scheduling tasks on unrelated machines: Large neighborhood improvement procedures. Journal of Heuristics 7, 519–531 (2001)

    Article  MATH  Google Scholar 

  16. Truemper, K.: On max flows with gains and pure min-cost flows. SIAM Journal on Applied Mathematics 32(2), 450–456 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  17. Vaidya, P.M.: Speeding up linear programming using fast matrix multiplication. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), pp. 332–337 (1989)

    Google Scholar 

  18. van de Velde, S.L.: Duality-based algorithms for scheduling unrelated parallel machines. ORSA Journal on Computing 5(2), 182–205 (1993)

    MathSciNet  Google Scholar 

  19. van den Akker, J.M., Hoogeveen, J.A., van de Velde, S.L.: Parallel machine scheduling by column generation. Operations Research 47(6), 862–872 (1999)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Fürstenallee 11, 33102, Paderborn, Germany

    Burkhard Monien & Andreas Woclaw

Authors
  1. Burkhard Monien
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Woclaw
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Software Department, Edifici Omega, Universitat Politècnica de Catalunya, Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    Carme Àlvarez

  2. ALBCOM Research Group, Universitat Politècnica de Catalunya, Edifici Ω, Campus Nord, Jordi Girona, 1-3, 08034, Barcelona, Spain

    María Serna

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monien, B., Woclaw, A. (2006). Scheduling Unrelated Parallel Machines Computational Results. In: Àlvarez, C., Serna, M. (eds) Experimental Algorithms. WEA 2006. Lecture Notes in Computer Science, vol 4007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11764298_18

Download citation

  • DOI: https://doi.org/10.1007/11764298_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34597-8

  • Online ISBN: 978-3-540-34598-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation