IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v206y2013i1p265-29610.1007-s10479-012-1296-x.html
   My bibliography  Save this article

Depth-first heuristic search for the job shop scheduling problem

Author

Listed:
  • Carlos Mencía
  • María Sierra
  • Ramiro Varela

Abstract

We evaluate two variants of depth-first search algorithms and consider the classic job shop scheduling problem as a test bed. The first one is the well-known branch-and-bound algorithm proposed by P. Brucker et al. which uses a single chronological backtracking strategy. The second is a variant that uses partially informed depth-first search strategy instead. Both algorithms use the same heuristic estimation; in the first case, it is only used for pruning states that cannot improve the incumbent solution, whereas in the second it is also used to sort the successors of an expanded state. We also propose and analyze a new heuristic estimation which is more informed and more time consuming than that used by Brucker’s algorithm. We conducted an experimental study over well-known instances showing that the proposed partially informed depth-first search algorithm outperforms the original Brucker’s algorithm. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • Carlos Mencía & María Sierra & Ramiro Varela, 2013. "Depth-first heuristic search for the job shop scheduling problem," Annals of Operations Research, Springer, vol. 206(1), pages 265-296, July.
    • Handle: RePEc:spr:annopr:v:206:y:2013:i:1:p:265-296:10.1007/s10479-012-1296-x
    DOI: 10.1007/s10479-012-1296-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-012-1296-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-012-1296-x?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. Carlier, Jacques, 1982. "The one-machine sequencing problem," European Journal of Operational Research, Elsevier, vol. 11(1), pages 42-47, September.
    2. Ulrich Dorndorf & Erwin Pesch & Toàn Phan-Huy, 2002. "Constraint Propagation and Problem Decomposition: A Preprocessing Procedure for the Job Shop Problem," Annals of Operations Research, Springer, vol. 115(1), pages 125-145, September.
    3. Taillard, E., 1993. "Benchmarks for basic scheduling problems," European Journal of Operational Research, Elsevier, vol. 64(2), pages 278-285, January.
    4. Blazewicz, Jacek & Pesch, Erwin & Sterna, Malgorzata, 2000. "The disjunctive graph machine representation of the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 127(2), pages 317-331, December.
    5. Wu, Tao & Shi, Leyuan & Geunes, Joseph & AkartunalI, Kerem, 2011. "An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging," European Journal of Operational Research, Elsevier, vol. 214(2), pages 428-441, October.
    6. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    7. Peter J. M. van Laarhoven & Emile H. L. Aarts & Jan Karel Lenstra, 1992. "Job Shop Scheduling by Simulated Annealing," Operations Research, INFORMS, vol. 40(1), pages 113-125, February.
    8. Sanja Petrovic & Carole Fayad & Dobrila Petrovic & Edmund Burke & Graham Kendall, 2008. "Fuzzy job shop scheduling with lot-sizing," Annals of Operations Research, Springer, vol. 159(1), pages 275-292, March.
    9. David Applegate & William Cook, 1991. "A Computational Study of the Job-Shop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 3(2), pages 149-156, May.
    10. J. Carlier & E. Pinson, 1989. "An Algorithm for Solving the Job-Shop Problem," Management Science, INFORMS, vol. 35(2), pages 164-176, February.
    11. Christian Artigues & Dominique Feillet, 2008. "A branch and bound method for the job-shop problem with sequence-dependent setup times," Annals of Operations Research, Springer, vol. 159(1), pages 135-159, March.
    12. Hoksung Yau & Leyuan Shi, 2009. "Nested partitions for the large-scale extended job shop scheduling problem," Annals of Operations Research, Springer, vol. 168(1), pages 23-39, April.
    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. Lin-Hui Sun & Kai Cui & Ju-Hong Chen & Jun Wang & Xian-Chen He, 2013. "Research on permutation flow shop scheduling problems with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 211(1), pages 473-480, December.
    2. Zhuo Yi & Ying Liao & Xuehui Du & Xin Lu & Lifeng Cao, 2020. "HiCoACR: A reconfiguration decision-making model for reconfigurable security protocol based on hierarchically collaborative ant colony," International Journal of Distributed Sensor Networks, , vol. 16(3), pages 15501477198, March.

    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. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    2. F. Guerriero, 2008. "Hybrid Rollout Approaches for the Job Shop Scheduling Problem," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 419-438, November.
    3. Francis Sourd & Wim Nuijten, 2000. "Multiple-Machine Lower Bounds for Shop-Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 341-352, November.
    4. 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.
    5. Diarmuid Grimes & Emmanuel Hebrard, 2015. "Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 268-284, May.
    6. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    7. Monaci, Marta & Agasucci, Valerio & Grani, Giorgio, 2024. "An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents," European Journal of Operational Research, Elsevier, vol. 312(3), pages 910-926.
    8. Pisut Pongchairerks, 2019. "A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem," Complexity, Hindawi, vol. 2019, pages 1-11, March.
    9. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    10. Edzard Weber & Anselm Tiefenbacher & Norbert Gronau, 2019. "Need for Standardization and Systematization of Test Data for Job-Shop Scheduling," Data, MDPI, vol. 4(1), pages 1-21, February.
    11. Pezzella, Ferdinando & Merelli, Emanuela, 2000. "A tabu search method guided by shifting bottleneck for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 297-310, January.
    12. Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
    13. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    14. Bahman Naderi & Rubén Ruiz & Vahid Roshanaei, 2023. "Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 817-843, July.
    15. Zapfel, G. & Wasner, M., 2000. "A heuristic solution concept for a generalized machine sequencing problem with an application to radiator manufacturing," International Journal of Production Economics, Elsevier, vol. 68(2), pages 199-213, November.
    16. 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.
    17. Carlier, Jacques & Rebai, Ismail, 1996. "Two branch and bound algorithms for the permutation flow shop problem," European Journal of Operational Research, Elsevier, vol. 90(2), pages 238-251, April.
    18. Demirkol, Ebru & Mehta, Sanjay & Uzsoy, Reha, 1998. "Benchmarks for shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 109(1), pages 137-141, August.
    19. Reinhard Bürgy, 2017. "A neighborhood for complex job shop scheduling problems with regular objectives," Journal of Scheduling, Springer, vol. 20(4), pages 391-422, August.
    20. Shahed Mahmud & Ripon K. Chakrabortty & Alireza Abbasi & Michael J. Ryan, 2022. "Switching strategy-based hybrid evolutionary algorithms for job shop scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 33(7), pages 1939-1966, 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:annopr:v:206:y:2013:i:1:p:265-296:10.1007/s10479-012-1296-x. 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.