IDEAS home Printed from https://ideas.repec.org/b/spr/ihinfo/978-3-319-99849-7.html
   My bibliography  Save this book

Handbook on Scheduling

Author

Listed:
  • Jacek Blazewicz

    (Institute of Computing Science, Poznan University of Technology, Poznan, Poland; Institute of Bioorganic Chemistry, Polish Academy of Sciences, Poznan, Poland; European Centre for Bioinformatics and Genomics)

  • Klaus H. Ecker

    (Clausthal University of Technology)

  • Erwin Pesch

    (Center for Advanced Studies in Management)

  • Günter Schmidt

    (Saarland University, Saarbrücken, Germany; University of Cape Town)

  • Malgorzata Sterna

    (Poznan University of Technology)

  • Jan Weglarz

    (Institute of Computing Science, Poznan University of Technology, Poznan, Poland; Poznan Supercomputing and Networking Center)

Abstract

No abstract is available for this item.

Individual chapters are listed in the "Chapters" tab

Suggested Citation

  • Jacek Blazewicz & Klaus H. Ecker & Erwin Pesch & Günter Schmidt & Malgorzata Sterna & Jan Weglarz, 2019. "Handbook on Scheduling," International Handbooks on Information Systems, Springer, edition 2, number 978-3-319-99849-7, November.
    • Handle: RePEc:spr:ihinfo:978-3-319-99849-7
    DOI: 10.1007/978-3-319-99849-7
    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. Joanna Józefowska & Mariusz Nowak & Rafał Różycki & Grzegorz Waligóra, 2022. "Survey on Optimization Models for Energy-Efficient Computing Systems," Energies, MDPI, vol. 15(22), pages 1-20, November.
    2. Helmut A. Sedding, 2020. "Scheduling jobs with a V-shaped time-dependent processing time," Journal of Scheduling, Springer, vol. 23(6), pages 751-768, December.
    3. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    4. Eduardo Queiroga & Rian G. S. Pinheiro & Quentin Christ & Anand Subramanian & Artur A. Pessoa, 2021. "Iterated local search for single machine total weighted tardiness batch scheduling," Journal of Heuristics, Springer, vol. 27(3), pages 353-438, June.
    5. Andrea Maria Zanchettin, 2022. "Robust scheduling and dispatching rules for high-mix collaborative manufacturing systems," Flexible Services and Manufacturing Journal, Springer, vol. 34(2), pages 293-316, June.
    6. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    7. Wang, Kai & Pesch, Erwin & Kress, Dominik & Fridman, Ilia & Boysen, Nils, 2022. "The Piggyback Transportation Problem: Transporting drones launched from a flying warehouse," European Journal of Operational Research, Elsevier, vol. 296(2), pages 504-519.
    8. Pablo Alvarez-Campana & Felix Villafanez & Fernando Acebes & David Poza, 2024. "Simulation-based approach for Multiproject Scheduling based on composite priority rules," Papers 2406.02102, arXiv.org.
    9. Müller, David & Müller, Marcus G. & Kress, Dominik & Pesch, Erwin, 2022. "An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning," European Journal of Operational Research, Elsevier, vol. 302(3), pages 874-891.
    10. Briskorn, Dirk & Waldherr, Stefan, 2022. "Anarchy in the UJ: Coordination mechanisms for minimizing the number of late jobs," European Journal of Operational Research, Elsevier, vol. 301(3), pages 815-827.
    11. Dvir Shabtay, 2023. "A new perspective on single-machine scheduling problems with late work related criteria," Annals of Operations Research, Springer, vol. 322(2), pages 947-966, March.
    12. Olivier Ploton & Vincent T’kindt, 2022. "Exponential-time algorithms for parallel machine scheduling problems," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3405-3418, December.
    13. Adel Kacem & Abdelaziz Dammak, 2021. "Multi-objective scheduling on two dedicated processors," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(3), pages 694-721, October.
    14. Hasani, Ali & Hosseini, Seyed Mohammad Hassan, 2020. "A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: Trade-off between production costs and energy consumption," Applied Mathematics and Computation, Elsevier, vol. 386(C).
    15. Justkowiak, Jan-Erik & Kovalev, Sergey & Kovalyov, Mikhail Y. & Pesch, Erwin, 2023. "Single machine scheduling with assignable due dates to minimize maximum and total late work," European Journal of Operational Research, Elsevier, vol. 308(1), pages 76-83.
    16. Sterna, Małgorzata, 2021. "Late and early work scheduling: A survey," Omega, Elsevier, vol. 104(C).
    17. Shabtay, Dvir & Mosheiov, Gur & Oron, Daniel, 2022. "Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work," European Journal of Operational Research, Elsevier, vol. 303(1), pages 66-77.
    18. Hellsten, Erik Orm & Sacramento, David & Pisinger, David, 2020. "An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports," European Journal of Operational Research, Elsevier, vol. 287(2), pages 682-698.

    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:ihinfo:978-3-319-99849-7. 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.