IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v10y2005i4d10.1007_s10878-005-4923-5.html
   My bibliography  Save this article

Preemptive Machine Covering on Parallel Machines

Author

Listed:
  • Yiwei Jiang

    (Zhejiang University)

  • Zhiyi Tan

    (Zhejiang University)

  • Yong He

    (Zhejiang University)

Abstract

This paper investigates the preemptive parallel machine scheduling to maximize the minimum machine completion time. We first show the off-line version can be solved in O(mn) time for general m-uniform-machine case. Then we study the on-line version. We show that any randomized on-line algorithm must have a competitive ratio m for m-uniform-machine case and ∑i = 1 m 1/i for m-identical-machine case. Lastly, we focus on two-uniform-machine case. We present an on-line deterministic algorithm whose competitive ratio matches the lower bound of the on-line problem for every machine speed ratio s≥ 1. We further consider the case that idle time is allowed to be introduced in the procedure of assigning jobs and the objective becomes to maximize the continuous period of time (starting from time zero) when both machines are busy. We present an on-line deterministic algorithm whose competitive ratio matches the lower bound of the problem for every s≥ 1. We show that randomization does not help.

Suggested Citation

  • Yiwei Jiang & Zhiyi Tan & Yong He, 2005. "Preemptive Machine Covering on Parallel Machines," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 345-363, December.
    • Handle: RePEc:spr:jcomop:v:10:y:2005:i:4:d:10.1007_s10878-005-4923-5
    DOI: 10.1007/s10878-005-4923-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-4923-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-005-4923-5?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
    ---><---

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

    References listed on IDEAS

    as
    1. Yong He & Zhiyi Tan, 2002. "Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time," Journal of Combinatorial Optimization, Springer, vol. 6(2), pages 199-206, June.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Yiwei Jiang & Ping Zhou & Wei Zhou, 2019. "MapReduce machine covering problem on a small number of machines," Journal of Combinatorial Optimization, Springer, vol. 38(4), pages 1066-1076, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Leah Epstein, 2023. "Parallel solutions for ordinal scheduling with a small number of machines," Journal of Combinatorial Optimization, Springer, vol. 46(1), pages 1-24, August.
    2. Rico Walter, 2013. "Comparing the minimum completion times of two longest-first scheduling-heuristics," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(1), pages 125-139, January.
    3. Rico Walter & Martin Wirth & Alexander Lawrinenko, 2017. "Improved approaches to the exact solution of the machine covering problem," Journal of Scheduling, Springer, vol. 20(2), pages 147-164, April.

    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:spr:jcomop:v:10:y:2005:i:4:d:10.1007_s10878-005-4923-5. 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.

    If CitEc recognized a bibliographic 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.

    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 (email available below). General contact details of provider: http://www.springer.com .

    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.