IDEAS home Printed from https://ideas.repec.org/a/spr/aqjoor/v20y2022i4d10.1007_s10288-022-00525-1.html
   My bibliography  Save this article

Moderate exponential-time algorithms for scheduling problems

Author

Listed:
  • Vincent T’kindt

    (University of Tours)

  • Federico Della Croce

    (Politecnico di Torino
    CNR,IEIIT)

  • Mathieu Liedloff

    (University of Orléans)

Abstract

This survey investigates the field of moderate exponential-time algorithms for $$\mathcal NP$$ N P -hard scheduling problems, i.e., exact algorithms whose worst-case time complexity is moderately exponential with respect to brute force algorithms. Scheduling problems are very challenging problems for which interesting results have emerged in the literature since 2010. We will provide a comprehensive overview of the known results of these problems before detailing three general techniques to derive moderate exponential-time algorithms. These techniques are Sort & Search, Inclusion–Exclusion and Branching. In the last part of this survey, we will focus on side topics such as approximation in moderate exponential time, the design of lower bounds on worst-case time complexities or fixed-parameter tractability. We will also discuss the potential benefits of moderate exponential-time algorithms for efficiently solving in practice scheduling problems.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:aqjoor:v:20:y:2022:i:4:d:10.1007_s10288-022-00525-1
    DOI: 10.1007/s10288-022-00525-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10288-022-00525-1
    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/s10288-022-00525-1?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. 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.
    2. Della Croce, Federico & T’kindt, Vincent & Ploton, Olivier, 2021. "Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms," Applied Mathematics and Computation, Elsevier, vol. 397(C).
    3. Vincent T’kindt & Lei Shang & Federico Della Croce, 2020. "Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 764-775, April.
    4. Danny Hermelin & Shlomo Karhi & Michael Pinedo & Dvir Shabtay, 2021. "New algorithms for minimizing the weighted number of tardy jobs on a single machine," Annals of Operations Research, Springer, vol. 298(1), pages 271-287, March.
    5. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    6. Linus Schrage & Kenneth R. Baker, 1978. "Dynamic Programming Solution of Sequencing Problems with Precedence Constraints," Operations Research, INFORMS, vol. 26(3), pages 444-449, June.
    7. Dušan Knop & Martin Koutecký, 2018. "Scheduling meets n-fold integer programming," Journal of Scheduling, Springer, vol. 21(5), pages 493-503, October.
    8. Vincent T’kindt & Federico Della Croce & Jean-Louis Bouquard, 2007. "Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 64-72, February.
    9. 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.
    10. Peter Brucker, 2007. "Scheduling Algorithms," Springer Books, Springer, edition 0, number 978-3-540-69516-5, December.
    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. Danny Hermelin & Dvir Shabtay & Chen Zelig & Michael Pinedo, 2022. "A general scheme for solving a large set of scheduling problems with rejection in FPT time," Journal of Scheduling, Springer, vol. 25(2), pages 229-255, April.
    2. 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.
    3. Klaus Heeger & Danny Hermelin & George B. Mertzios & Hendrik Molter & Rolf Niedermeier & Dvir Shabtay, 2023. "Equitable scheduling on a single machine," Journal of Scheduling, Springer, vol. 26(2), pages 209-225, April.
    4. Bock, Felix & Bruhn, Henning, 2021. "Case study on scheduling cyclic conveyor belts," Omega, Elsevier, vol. 102(C).
    5. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    6. Wlodzimierz Szwarc & Jatinder N. D. Gupta, 1987. "A flow‐shop problem with sequence‐dependent additive setup times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 619-627, October.
    7. Lei Pan & Xinyu Sun & Ji-Bo Wang & Li-Han Zhang & Dan-Yang Lv, 2023. "Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-16, May.
    8. Liqi Zhang & Lingfa Lu & Shisheng Li, 2016. "New results on two-machine flow-shop scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1493-1504, May.
    9. Becker, Christian & Scholl, Armin, 2006. "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 694-715, February.
    10. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    11. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    12. Della Croce, Federico & Koulamas, Christos & T'kindt, Vincent, 2017. "A constraint generation approach for two-machine shop problems with jobs selection," European Journal of Operational Research, Elsevier, vol. 259(3), pages 898-905.
    13. Vineet Jain & Tilak Raj, 2018. "An adaptive neuro-fuzzy inference system for makespan estimation of flexible manufacturing system assembly shop: a case study," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(6), pages 1302-1314, December.
    14. Borba, Leonardo & Ritt, Marcus & Miralles, Cristóbal, 2018. "Exact and heuristic methods for solving the Robotic Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 146-156.
    15. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    16. Yagiura, Mutsunori & Ibaraki, Toshihide, 1996. "The use of dynamic programming in genetic algorithms for permutation problems," European Journal of Operational Research, Elsevier, vol. 92(2), pages 387-401, July.
    17. Golpîra, Hêriş, 2020. "Smart Energy-Aware Manufacturing Plant Scheduling under Uncertainty: A Risk-Based Multi-Objective Robust Optimization Approach," Energy, Elsevier, vol. 209(C).
    18. Alexander Grigoriev & Martijn Holthuijsen & Joris van de Klundert, 2005. "Basic scheduling problems with raw material constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 527-535, September.
    19. Shiwei Chang & Hirofumi Matsuo & Guochun Tang, 1990. "Worst‐case analysis of local search heuristics for the one‐machine total tardiness problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 111-121, February.
    20. Xin Tang & Ameur Soukhal & Vincent T’kindt, 2014. "Preprocessing for a map sectorization problem by means of mathematical programming," Annals of Operations Research, Springer, vol. 222(1), pages 551-569, November.

    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:aqjoor:v:20:y:2022:i:4:d:10.1007_s10288-022-00525-1. 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.