IDEAS home Printed from https://ideas.repec.org/b/spr/sprbok/978-3-540-69516-5.html
   My bibliography  Save this book

Scheduling Algorithms

Author

Listed:
  • Peter Brucker

    (Universität Osnabrück)

Abstract

No abstract is available for this item.

Individual chapters are listed in the "Chapters" tab

Suggested Citation

  • Peter Brucker, 2007. "Scheduling Algorithms," Springer Books, Springer, edition 0, number 978-3-540-69516-5, December.
    • Handle: RePEc:spr:sprbok:978-3-540-69516-5
    DOI: 10.1007/978-3-540-69516-5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Bock, Felix & Bruhn, Henning, 2021. "Case study on scheduling cyclic conveyor belts," Omega, Elsevier, vol. 102(C).
    2. Li-on Raviv & Amir Leshem, 2019. "Scheduling for Multi-User Multi-Input Multi-Output Wireless Networks with Priorities and Deadlines," Future Internet, MDPI, vol. 11(8), pages 1-20, August.
    3. Vincent T’kindt & Federico Della Croce & Mathieu Liedloff, 2022. "Moderate exponential-time algorithms for scheduling problems," 4OR, Springer, vol. 20(4), pages 533-566, December.
    4. de Weerdt, Mathijs & Baart, Robert & He, Lei, 2021. "Single-machine scheduling with release times, deadlines, setup times, and rejection," European Journal of Operational Research, Elsevier, vol. 291(2), pages 629-639.
    5. Brachmann, Robert & Kolisch, Rainer, 2021. "The impact of flexibility on engineer-to-order production planning," International Journal of Production Economics, Elsevier, vol. 239(C).
    6. Talebiyan, Hesam & Dueñas-Osorio, Leonardo, 2023. "Auctions for resource allocation and decentralized restoration of interdependent networks," Reliability Engineering and System Safety, Elsevier, vol. 237(C).
    7. Sha, Yue & Zhang, Junlong & Cao, Hui, 2021. "Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties," European Journal of Operational Research, Elsevier, vol. 290(3), pages 886-900.
    8. Yakov Zinder & Alexandr Kononov & Joey Fung, 2021. "A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements," Journal of Combinatorial Optimization, Springer, vol. 42(2), pages 276-309, August.
    9. Branislav Micieta & Jolanta Staszewska & Matej Kovalsky & Martin Krajcovic & Vladimira Binasova & Ladislav Papanek & Ivan Antoniuk, 2021. "Innovative System for Scheduling Production Using a Combination of Parametric Simulation Models," Sustainability, MDPI, vol. 13(17), pages 1-20, August.
    10. Novak, Antonin & Gnatowski, Andrzej & Sucha, Premysl, 2022. "Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations," European Journal of Operational Research, Elsevier, vol. 302(2), pages 438-455.
    11. Yanıkoğlu, İhsan & Yavuz, Tonguc, 2022. "Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 301(3), pages 875-895.
    12. Shibasaki, Rui S. & Rossi, André & Gurevsky, Evgeny, 2024. "A new upper bound based on Dantzig-Wolfe decomposition to maximize the stability radius of a simple assembly line under uncertainty," European Journal of Operational Research, Elsevier, vol. 313(3), pages 1015-1030.

    Book Chapters

    The following chapters of this book are listed in IDEAS

    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:spr:sprbok:978-3-540-69516-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.

    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: 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.