Encyclopedia of Algorithms

Living Edition
| Editors: Ming-Yang Kao

Maximizing the Minimum Machine Load

  • Csanad  ImrehEmail author
Living reference work entry
DOI: https://doi.org/10.1007/978-3-642-27848-8_503-1

Years and Authors of Summarized Original Work

1982; Deuermeyer, Friesen, Langston

1997; Woeginger

1998; Azar, Epstein

Problem Definition

In a scheduling problem we have to find an optimal schedule of jobs. Here we consider the parallel machines case, where m machines are given, and we can use them to schedule the jobs. In the most fundamental model, each job has a known processing time, and to schedule the job we have to assign it to a machine, and we have to give its starting time and a completion time, where the difference between the completion time and the starting time is the processing time. No machine may simultaneously run two jobs. If no further assumptions are given then the machines can schedule the jobs assigned to them without an idle time and the total time required to schedule the jobs on a machine is the sum of the processing times of the jobs assigned to it. We call this value the load of the machine.

Concerning the machine environment three different models are...


Scheduling Approximation algorithms Multiprocessor systems 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Azar Y, Epstein L (1998) On-line machine covering. J Sched 1(2):67–77CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Bezáková I, Dani V (2005) Nobody left behind: fair allocation of indivisible goods. ACM SIGecom Exch 5.3CrossRefGoogle Scholar
  3. 3.
    Csirik J, Kellerer H, Woeginger GJ (1992) The exact LPT-bound for maximizing the minimum completion time. Oper Res Lett 11:281–287CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Deuermeyer BL, Friesen DK, Langston MA (1982) Scheduling to maximize the minimum processor finish time in a multiprocessor system. SIAM J Discret Methods 3:190–196CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    He Y, Zhang GC (1999) Semi on-line scheduling on two identical machines. Computing 62:179–187CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Tan Z, Wu Y (2007) Optimal semi-online algorithms for machine covering. Theor Comput Sci 372:69–80CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Woeginger GJ (1997) A polynomial time approximation scheme for maximizing the minimum machine completion time. Oper Res Lett 20(4):149–154CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Institute of InformaticsUniversity of SzegedSzegedHungary