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

Scheduling shared continuous resources on many-cores

Author

Listed:
  • Ernst Althaus

    (Johannes Gutenberg-Universität Mainz)

  • André Brinkmann

    (Johannes Gutenberg-Universität Mainz)

  • Peter Kling

    (Simon Fraser University)

  • Friedhelm Meyer Heide

    (Paderborn University)

  • Lars Nagel

    (Johannes Gutenberg-Universität Mainz)

  • Sören Riechers

    (Paderborn University)

  • Jiří Sgall

    (Charles University)

  • Tim Süß

    (Johannes Gutenberg-Universität Mainz)

Abstract

We consider the problem of scheduling a number of jobs on m identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement . The job can be processed at full speed if granted its full resource requirement. If receiving only an x-portion of $$r_j$$ r j , it is processed at an x-fraction of the full speed. Our goal is to find a resource assignment that minimizes the makespan (i.e., the latest completion time). Variants of such problems, relating the resource assignment of jobs to their processing speeds, have been studied under the term discrete–continuous scheduling. Known results are either very pessimistic or heuristic in nature. In this article, we suggest and analyze a slightly simplified model. It focuses on the assignment of shared continuous resources to the processors. The job assignment to processors and the ordering of the jobs have already been fixed. It is shown that, even for unit size jobs, finding an optimal solution is NP-hard if the number of processors is part of the input. Positive results for unit size jobs include a polynomial-time algorithm for any constant number of processors. Since the running time is infeasible for practical purposes, we also provide more efficient algorithm variants: an optimal algorithm for two processors and a -approximation algorithm for m processors.

Suggested Citation

  • Ernst Althaus & André Brinkmann & Peter Kling & Friedhelm Meyer Heide & Lars Nagel & Sören Riechers & Jiří Sgall & Tim Süß, 2018. "Scheduling shared continuous resources on many-cores," Journal of Scheduling, Springer, vol. 21(1), pages 77-92, February.
    • Handle: RePEc:spr:jsched:v:21:y:2018:i:1:d:10.1007_s10951-017-0518-0
    DOI: 10.1007/s10951-017-0518-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-017-0518-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-017-0518-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. Jozefowska, Joanna & Weglarz, Jan, 1996. "Discrete-continuous scheduling problems -- Mean completion time results," European Journal of Operational Research, Elsevier, vol. 94(2), pages 302-309, October.
    2. Jacek Błażewicz & Klaus H. Ecker & Erwin Pesch & Günter Schmidt & Jan Węglarz, 2007. "Handbook on Scheduling," International Handbooks on Information Systems, Springer, number 978-3-540-32220-7, November.
    3. Joanna Józefowska & Marek Mika & Rafał Różycki & Grzegorz Waligóra & Jan Weglarz, 2000. "Solving the discrete-continuous project scheduling problem via its discretization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(3), pages 489-499, December.
    4. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    Full references (including those not matched with items on IDEAS)

    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. Naber, Anulark & Kolisch, Rainer, 2014. "MIP models for resource-constrained project scheduling with flexible resource profiles," European Journal of Operational Research, Elsevier, vol. 239(2), pages 335-348.
    2. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    3. He, Zhengwen & Liu, Renjing & Jia, Tao, 2012. "Metaheuristics for multi-mode capital-constrained project payment scheduling," European Journal of Operational Research, Elsevier, vol. 223(3), pages 605-613.
    4. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    5. Zhengwen He & Nengmin Wang & Pengxiang Li, 2014. "Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective," Annals of Operations Research, Springer, vol. 213(1), pages 203-220, February.
    6. Estévez-Fernández, Arantza, 2012. "A game theoretical approach to sharing penalties and rewards in projects," European Journal of Operational Research, Elsevier, vol. 216(3), pages 647-657.
    7. Byung-Cheon Choi & Changmuk Kang, 2019. "A linear time–cost tradeoff problem with multiple milestones under a comb graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 341-361, August.
    8. Servranckx, Tom & Vanhoucke, Mario, 2019. "Strategies for project scheduling with alternative subgraphs under uncertainty: similar and dissimilar sets of schedules," European Journal of Operational Research, Elsevier, vol. 279(1), pages 38-53.
    9. Nima Zoraghi & Aria Shahsavar & Babak Abbasi & Vincent Peteghem, 2017. "Multi-mode resource-constrained project scheduling problem with material ordering under bonus–penalty policies," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 49-79, April.
    10. Luis F. Machado-Domínguez & Carlos D. Paternina-Arboleda & Jorge I. Vélez & Agustin Barrios-Sarmiento, 2021. "A memetic algorithm to address the multi-node resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 24(4), pages 413-429, August.
    11. Ellinas, Christos & Allan, Neil & Johansson, Anders, 2016. "Project systemic risk: Application examples of a network model," International Journal of Production Economics, Elsevier, vol. 182(C), pages 50-62.
    12. Malgorzata Sterna & Kateryna Czerniachowska, 2017. "Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work," Journal of Optimization Theory and Applications, Springer, vol. 174(3), pages 927-944, September.
    13. Ripon K. Chakrabortty & Ruhul A. Sarker & Daryl L. Essam, 2020. "Single mode resource constrained project scheduling with unreliable resources," Operational Research, Springer, vol. 20(3), pages 1369-1403, September.
    14. Beşikci, Umut & Bilge, Ümit & Ulusoy, Gündüz, 2015. "Multi-mode resource constrained multi-project scheduling and resource portfolio problem," European Journal of Operational Research, Elsevier, vol. 240(1), pages 22-31.
    15. Mauricio Diéguez & Jaime Bustos & Carlos Cares, 2020. "Mapping the variations for implementing information security controls to their operational research solutions," Information Systems and e-Business Management, Springer, vol. 18(2), pages 157-186, June.
    16. Jeunet, Jully & Bou Orm, Mayassa, 2020. "Optimizing temporary work and overtime in the Time Cost Quality Trade-off Problem," European Journal of Operational Research, Elsevier, vol. 284(2), pages 743-761.
    17. Lin, Jun & Qian, Yanjun & Cui, Wentian & Goh, Thong Ngee, 2015. "An effective approach for scheduling coupled activities in development projects," European Journal of Operational Research, Elsevier, vol. 243(1), pages 97-108.
    18. Geng, Zhichao & Yuan, Jinjiang, 2023. "Single-machine scheduling of multiple projects with controllable processing times," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1074-1090.
    19. Van Peteghem, Vincent & Vanhoucke, Mario, 2014. "An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances," European Journal of Operational Research, Elsevier, vol. 235(1), pages 62-72.
    20. Florian Mischek & Nysret Musliu & Andrea Schaerf, 2023. "Local search approaches for the test laboratory scheduling problem with variable task grouping," Journal of Scheduling, Springer, vol. 26(5), pages 457-477, October.

    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:1:d:10.1007_s10951-017-0518-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.