IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v21y2018i6d10.1007_s10951-018-0566-0.html
   My bibliography  Save this article

Shared processor scheduling

Author

Listed:
  • Dariusz Dereniowski

    (Gdańsk University of Technology)

  • Wiesław Kubiak

    (Memorial University)

Abstract

We study the shared processor scheduling problem with a single shared processor to maximize total weighted overlap, where an overlap for a job is the amount of time it is processed on its private and shared processor in parallel. A polynomial-time optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an $$O(n \log n)$$ O ( n log n ) -time optimization algorithm for a class of instances in which non-decreasing order of jobs with respect to processing times provides a non-increasing order with respect to weights—this instance generalizes the unweighted case of the problem. This algorithm also leads to a $$\frac{1}{2}$$ 1 2 -approximation algorithm for the general weighted problem. The complexity of the weighted problem remains open.

Suggested Citation

  • Dariusz Dereniowski & Wiesław Kubiak, 2018. "Shared processor scheduling," Journal of Scheduling, Springer, vol. 21(6), pages 583-593, December.
    • Handle: RePEc:spr:jsched:v:21:y:2018:i:6:d:10.1007_s10951-018-0566-0
    DOI: 10.1007/s10951-018-0566-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-018-0566-0
    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/s10951-018-0566-0?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. George L. Vairaktarakis, 2013. "Noncooperative Games for Subcontracting Operations," Manufacturing & Service Operations Management, INFORMS, vol. 15(1), pages 148-158, September.
    2. Dereniowski, Dariusz & Kubiak, Wiesław, 2017. "Shared multi-processor scheduling," European Journal of Operational Research, Elsevier, vol. 261(2), pages 503-514.
    3. Yossi Bukchin & Eran Hanany, 2007. "Decentralization Cost in Scheduling: A Game-Theoretic Approach," Manufacturing & Service Operations Management, INFORMS, vol. 9(3), pages 263-275, October.
    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. Dereniowski, Dariusz & Kubiak, Wiesław, 2020. "Shared processor scheduling of multiprocessor jobs," European Journal of Operational Research, Elsevier, vol. 282(2), pages 464-477.
    2. Yunhong Min & Byung-Cheon Choi & Myoung-Ju Park & Kyung Min Kim, 2023. "A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work," 4OR, Springer, vol. 21(3), pages 421-437, September.

    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. Dereniowski, Dariusz & Kubiak, Wiesław, 2020. "Shared processor scheduling of multiprocessor jobs," European Journal of Operational Research, Elsevier, vol. 282(2), pages 464-477.
    2. Herbert Hamers & Flip Klijn & Marco Slikker, 2013. "Price of Anarchy in Sequencing Situations and the Impossibility to Coordinate," Working Papers 709, Barcelona School of Economics.
    3. Xiaoqiang Cai & George L. Vairaktarakis, 2012. "Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs," Operations Research, INFORMS, vol. 60(6), pages 1436-1450, December.
    4. Braat, Jac & Hamers, Herbert & Klijn, Flip & Slikker, Marco, 2019. "A selfish allocation heuristic in scheduling: Equilibrium and inefficiency bound analysis," European Journal of Operational Research, Elsevier, vol. 273(2), pages 634-645.
    5. Wang, Xiuli & Geng, Sujie & Cheng, T.C.E., 2018. "Negotiation mechanisms for an order subcontracting and scheduling problem," Omega, Elsevier, vol. 77(C), pages 154-167.
    6. Dereniowski, Dariusz & Kubiak, Wiesław, 2017. "Shared multi-processor scheduling," European Journal of Operational Research, Elsevier, vol. 261(2), pages 503-514.
    7. Tolga Aydinliyim & George L. Vairaktarakis, 2010. "Coordination of Outsourced Operations to Minimize Weighted Flow Time and Capacity Booking Costs," Manufacturing & Service Operations Management, INFORMS, vol. 12(2), pages 236-255, January.
    8. Herbert Hamers & Flip Klijn & Marco Slikker, 2019. "Implementation of optimal schedules in outsourcing with identical suppliers," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(2), pages 173-187, 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:jsched:v:21:y:2018:i:6:d:10.1007_s10951-018-0566-0. 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.