IDEAS home Printed from
   My bibliography  Save this article

Scheduling fully parallel jobs


  • Kai Wang

    () (City University of Hong Kong)

  • Vincent Chau

    () (Shenzhen Institutes of Advanced Technology)

  • Minming Li

    () (City University of Hong Kong)


We consider the following scheduling problem. We have m identical machines, where each machine can accomplish one unit of work at each time unit. We have a set of n fully parallel jobs, where each job j has $$s_j$$ s j units of workload, and each unit workload can be executed on any machine at any time unit. A job is considered complete when its entire workload has been executed. The objective is to find a schedule that minimizes the total weighted completion time $$\sum w_j C_j$$ ∑ w j C j , where $$w_j$$ w j is the weight of job j and $$C_j$$ C j is the completion time of job j. We provide theoretical results for this problem. First, we give a PTAS of this problem with fixed m. We then consider the special case where $$w_j = s_j$$ w j = s j for each job j, and we show that it is polynomial solvable with fixed m. Finally, we study the approximation ratio of a greedy algorithm, the Largest-Ratio-First algorithm. For the special case, we show that the approximation ratio depends on the instance size, i.e. n and m, while for the general case where jobs have arbitrary weights, we prove that the upper bound of the approximation ratio is $$1 + \frac{m-1}{m+2}$$ 1 + m - 1 m + 2 .

Suggested Citation

  • Kai Wang & Vincent Chau & Minming Li, 2018. "Scheduling fully parallel jobs," Journal of Scheduling, Springer, vol. 21(6), pages 619-631, December.
  • Handle: RePEc:spr:jsched:v:21:y:2018:i:6:d:10.1007_s10951-018-0563-3
    DOI: 10.1007/s10951-018-0563-3

    Download full text from publisher

    File URL:
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. Chang Sup Sung & Sang Hum Yoon, 1998. "Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines," International Journal of Production Economics, Elsevier, vol. 54(3), pages 247-255, May.
    Full references (including those not matched with items on IDEAS)


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jsched:v:21:y:2018:i:6:d:10.1007_s10951-018-0563-3. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Springer Nature Abstracting and Indexing). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.