IDEAS home Printed from https://ideas.repec.org/a/bla/stanee/v44y1990i3p115-123.html
   My bibliography  Save this article

Scheduling identical jobs on uniform parallel machines

Author

Listed:
  • M.I. Dessouky
  • B.J. Lageweg
  • J.K. Lenstra
  • S.L. van de Velde

Abstract

We address the problem of scheduling n identical jobs on m uniform parallel machines to optimize scheduling criteria that are nondecreasing in the job completion times. It is well known that this can be formulated as a linear assignment problem, and subsequently solved in O(n3) time. We give a more concise formulation for minsum criteria, and show that general minmax criteria can be minimized in O(n2) time. We present faster algorithms, requiring only O(n+mlog m) time for minimizing makespan and total completion time, O(nlogn) time for minimizing total weighted completion time, maximum lateness, total tardiness and the weighted number of tardy jobs, and O(nlog2n) time for maximum weighted tardiness. In the case of release dates, we propose an O(nlogn) algorithm for minimizing makespan, and an O(mn2m+1) time dynamic programming algorithm for minimizing total completion time.

Suggested Citation

  • M.I. Dessouky & B.J. Lageweg & J.K. Lenstra & S.L. van de Velde, 1990. "Scheduling identical jobs on uniform parallel machines," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 44(3), pages 115-123, September.
    • Handle: RePEc:bla:stanee:v:44:y:1990:i:3:p:115-123
    DOI: 10.1111/j.1467-9574.1990.tb01276.x
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/j.1467-9574.1990.tb01276.x
    Download Restriction: no
    File URL: https://libkey.io/10.1111/j.1467-9574.1990.tb01276.x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dessouky, Maged M. & Dessouky, Mohamed I. & Verma, Sushil K., 1998. "Flowshop scheduling with identical jobs and uniform parallel machines," European Journal of Operational Research, Elsevier, vol. 109(3), pages 620-631, September.
    2. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    3. Timkovsky, Vadim G., 2003. "Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity," European Journal of Operational Research, Elsevier, vol. 149(2), pages 355-376, September.
    4. Peter Brucker & Natalia V. Shakhlevich, 2016. "Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines," Journal of Scheduling, Springer, vol. 19(6), pages 659-685, December.
    5. Donatas Elvikis & Vincent T’kindt, 2014. "Two-agent scheduling on uniform parallel machines with min-max criteria," Annals of Operations Research, Springer, vol. 213(1), pages 79-94, February.
    6. Baptiste, Philippe, 2003. "On minimizing the weighted number of late jobs in unit execution time open-shops," European Journal of Operational Research, Elsevier, vol. 149(2), pages 344-354, September.
    7. Arbib, Claudio & Felici, Giovanni & Servilio, Mara, 2019. "Common operation scheduling with general processing times: A branch-and-cut algorithm to minimize the weighted number of tardy jobs," Omega, Elsevier, vol. 84(C), pages 18-30.
    8. Nodari Vakhania & Frank Werner, 2021. "Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines," Mathematics, MDPI, vol. 9(6), pages 1-18, March.
    9. Jiang, Xiaojuan & Lee, Kangbok & Pinedo, Michael L., 2021. "Ideal schedules in parallel machine settings," European Journal of Operational Research, Elsevier, vol. 290(2), pages 422-434.
    10. Qiulan Zhao & Jinjiang Yuan, 2020. "Bicriteria scheduling of equal length jobs on uniform parallel machines," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 637-661, April.
    11. Chen, Rubing & Geng, Zhichao & Lu, Lingfa & Yuan, Jinjiang & Zhang, Yuan, 2022. "Pareto-scheduling of two competing agents with their own equal processing times," European Journal of Operational Research, Elsevier, vol. 301(2), pages 414-431.
    12. D. Prot & O. Bellenguez-Morineau, 2018. "A survey on how the structure of precedence constraints may change the complexity class of scheduling problems," Journal of Scheduling, Springer, vol. 21(1), pages 3-16, February.
    13. Jun-Ho Lee & Hoon Jang, 2019. "Uniform Parallel Machine Scheduling with Dedicated Machines, Job Splitting and Setup Resources," Sustainability, MDPI, vol. 11(24), pages 1-23, December.
    14. Cheng, T. C. Edwin & Gordon, Valery S. & Kovalyov, Mikhail Y., 1996. "Single machine scheduling with batch deliveries," European Journal of Operational Research, Elsevier, vol. 94(2), pages 277-283, October.
    15. Janiak, Adam & Krysiak, Tomasz & Pappis, Costas P. & Voutsinas, Theodore G., 2009. "A scheduling problem with job values given as a power function of their completion times," European Journal of Operational Research, Elsevier, vol. 193(3), pages 836-848, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:bla:stanee:v:44:y:1990:i:3:p:115-123. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0039-0402 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.