Logic-based benders decomposition methods for the distributed flexible job shop scheduling problem
The Distributed Flexible Job Shop Scheduling Problem (DFJSP) is a well-known NP-hard optimization problem with widespread applications in production scheduling. It involves assigning jobs to factories, allocating operations to machines, and sequencing operations on each machine, which presents signi...
Uložené v:
| Vydané v: | European journal of operational research |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.09.2025
|
| Predmet: | |
| ISSN: | 0377-2217 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The Distributed Flexible Job Shop Scheduling Problem (DFJSP) is a well-known NP-hard optimization problem with widespread applications in production scheduling. It involves assigning jobs to factories, allocating operations to machines, and sequencing operations on each machine, which presents significant computational challenges. Although heuristic and metaheuristic approaches have been extensively studied, the exploration of exact algorithms for solving DFJSP remains limited. This paper addresses this gap by proposing three logic-based Benders decomposition (LBBD) frameworks specifically designed for the DFJSP, leveraging the problem’s decomposable structure to achieve optimal or near-optimal solutions with quantifiable quality guarantees within strict time limits. In each LBBD framework, the DFJSP is decomposed into a master problem and several subproblems based on specific decomposition schemes. The corresponding Mixed-Integer Linear Programming (MILP) models and Constraint programming (CP) models for these problems are formulated and solved alternately. Additionally, a hybrid optimization approach is developed by integrating LBBD with CP and heuristic search strategies. The proposed method includes an enhanced CP model with targeted improvements to boost its solving efficiency and incorporates a critical path-based local search strategy to further refine the solution quality. Moreover, several strong subproblem relaxation schemes are incorporated into the master problem under different LBBD frameworks. Comprehensive evaluations on an extended benchmark dataset containing 286 instances demonstrate that the hybrid algorithm achieves an average optimality gap of less than 1.2%. Compared to state-of-the-art MILP, CP, and heuristic methods, the proposed approach delivers superior solution quality and computational efficiency, establishing a new benchmark for solving the DFJSP.
•Three logic-based Benders decomposition frameworks to the DFJSP structure.•Development of MILP and CP models for master and subproblems.•Local search with critical path-based CP for subproblems.•Strong subproblem relaxations to tighten the master problem.•New benchmark established by the proposed LBBD for the DFJSP. |
|---|---|
| AbstractList | The Distributed Flexible Job Shop Scheduling Problem (DFJSP) is a well-known NP-hard optimization problem with widespread applications in production scheduling. It involves assigning jobs to factories, allocating operations to machines, and sequencing operations on each machine, which presents significant computational challenges. Although heuristic and metaheuristic approaches have been extensively studied, the exploration of exact algorithms for solving DFJSP remains limited. This paper addresses this gap by proposing three logic-based Benders decomposition (LBBD) frameworks specifically designed for the DFJSP, leveraging the problem’s decomposable structure to achieve optimal or near-optimal solutions with quantifiable quality guarantees within strict time limits. In each LBBD framework, the DFJSP is decomposed into a master problem and several subproblems based on specific decomposition schemes. The corresponding Mixed-Integer Linear Programming (MILP) models and Constraint programming (CP) models for these problems are formulated and solved alternately. Additionally, a hybrid optimization approach is developed by integrating LBBD with CP and heuristic search strategies. The proposed method includes an enhanced CP model with targeted improvements to boost its solving efficiency and incorporates a critical path-based local search strategy to further refine the solution quality. Moreover, several strong subproblem relaxation schemes are incorporated into the master problem under different LBBD frameworks. Comprehensive evaluations on an extended benchmark dataset containing 286 instances demonstrate that the hybrid algorithm achieves an average optimality gap of less than 1.2%. Compared to state-of-the-art MILP, CP, and heuristic methods, the proposed approach delivers superior solution quality and computational efficiency, establishing a new benchmark for solving the DFJSP.
•Three logic-based Benders decomposition frameworks to the DFJSP structure.•Development of MILP and CP models for master and subproblems.•Local search with critical path-based CP for subproblems.•Strong subproblem relaxations to tighten the master problem.•New benchmark established by the proposed LBBD for the DFJSP. |
| Author | Liu, Hengchong Xiong, Fuli |
| Author_xml | – sequence: 1 givenname: Fuli orcidid: 0000-0003-3171-2142 surname: Xiong fullname: Xiong, Fuli email: xiongfuli@xauat.edu.cn – sequence: 2 givenname: Hengchong surname: Liu fullname: Liu, Hengchong |
| BookMark | eNp9kMtKxDAYhbMYwZnRF3CVF2j9k97BjQzeoOBG1yGXP9OUtilJR_Tt7TCuXZ3F4Tscvh3ZTH5CQu4YpAxYed-n2PuQcuBFCnUKWbMhW8iqKuGcVddkF2MPAKxgxZao1h-dTpSMaKjCyWCI1KD24-yjW5yf6IhL502k1ge6dEiNi0tw6rSshB3w26kBae8VjZ2fadQdmtPgpiOdg1-r8YZcWTlEvP3LPfl8fvo4vCbt-8vb4bFNNCvrJWEFr-rSmBJs3ijFeKEMA7CNKXlWWqysspo3Oi-krbjmktU5z3JspKyAa5PtCb_s6uBjDGjFHNwow49gIM5mRC_OZsTZjIBarGZW6OEC4frsy2EQUTucNBoXUC_CePcf_guz4XMJ |
| Cites_doi | 10.1016/j.engappai.2023.107030 10.1287/opre.1060.0371 10.1109/ACCESS.2020.3032548 10.1287/trsc.2019.0928 10.1287/opre.2013.1248 10.1080/00207543.2013.827806 10.1007/s10107-003-0375-9 10.1016/j.ejor.2024.05.041 10.1016/j.swevo.2021.100861 10.1109/TCYB.2023.3280175 10.1016/j.cie.2021.107318 10.1016/j.eswa.2022.117984 10.1007/s11227-013-0986-8 10.1016/j.asoc.2022.108694 10.1287/ijoc.1110.0458 10.1023/A:1018930406487 10.23919/CSMS.2022.0010 10.1007/s10845-015-1084-y 10.1016/j.ejor.2024.03.004 10.1016/j.jmsy.2024.03.002 10.1287/trsc.2018.0830 10.1016/j.cor.2022.105704 10.1287/ijoc.2021.1113 10.1016/j.swevo.2022.101139 10.1007/s12293-018-00278-7 10.1287/mnsc.35.2.164 10.1109/ACCESS.2018.2873401 10.1007/s10845-015-1083-z 10.1016/j.aei.2024.102647 10.1287/ijoc.2015.0666 10.1016/j.omega.2022.102805 10.1016/j.jclepro.2021.126093 10.1287/ijoo.2021.0056 10.1016/j.ejor.2024.05.001 10.1016/j.swevo.2024.101658 10.1016/j.ejor.2020.12.004 10.1016/j.jmsy.2023.09.002 10.1016/j.eswa.2020.113721 10.1016/j.procs.2018.08.114 10.1016/j.ejor.2024.08.010 10.1016/j.ejor.2023.05.017 10.1016/j.eswa.2023.119840 10.1016/j.ejor.2023.07.032 10.1002/aic.18491 10.1016/j.cor.2009.06.019 10.1007/BF01719451 10.1016/j.cie.2023.109542 10.1016/j.ejor.2009.01.008 10.1016/j.ejor.2024.11.033 10.1007/BF02023073 10.1007/s10845-007-0026-8 10.1287/ijoc.2023.1287 10.1016/j.engappai.2024.109557 10.1016/j.asoc.2024.112330 10.1016/j.swevo.2024.101753 10.1016/j.cie.2020.106347 10.1287/ijoc.2020.1014 10.1016/j.ejor.2024.04.013 |
| ContentType | Journal Article |
| Copyright | 2025 Elsevier B.V. |
| Copyright_xml | – notice: 2025 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2025.08.039 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| ExternalDocumentID | 10_1016_j_ejor_2025_08_039 S0377221725006769 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29G 4.4 41~ 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AATTM AAXKI AAXUO AAYFN AAYWO ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACIWK ACLOT ACNCT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADGUI ADIYS ADJOM ADMUD ADNMO ADXHL AEBSH AEFWE AEIPS AEKER AENEX AEUPX AFFNX AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGII AIGVJ AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APLSM APXCP ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U VH1 WUQ XPP ZMT ~02 ~G- ~HD 9DU AAYXX CITATION |
| ID | FETCH-LOGICAL-c168t-152786dd60f49bb125bd100f9d6236fe7fbfc29c45af72c2a184234e9aa702cd3 |
| ISSN | 0377-2217 |
| IngestDate | Sat Nov 29 06:52:01 EST 2025 Sat Oct 11 16:52:09 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Local search Mixed integer linear programming Logic-based benders decomposition Distributed flexible job shop scheduling problem Constraint programming |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c168t-152786dd60f49bb125bd100f9d6236fe7fbfc29c45af72c2a184234e9aa702cd3 |
| ORCID | 0000-0003-3171-2142 |
| ParticipantIDs | crossref_primary_10_1016_j_ejor_2025_08_039 elsevier_sciencedirect_doi_10_1016_j_ejor_2025_08_039 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-9-00 |
| PublicationDateYYYYMMDD | 2025-09-01 |
| PublicationDate_xml | – month: 09 year: 2025 text: 2025-9-00 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2025 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Baloch, Gzara (b1) 2020; 54 Brandimarte (b2) 1993; 41 Li, Gu, Zhang (b28) 2022; 2 Fan, Wang, Tian (b12) 2024; 74 Kasapidis, Paraskevopoulos, Mourtos, Repoussis (b23) 2025; 320 Roshanaei (b46) 2012 Li, Côté, Callegari-Coelho, Wu (b24) 2022; 34 Wang, Wu, Peng (b55) 2024; 167 Xie, Li, Gao (b57) 2023; 71 Luo, Deng, Gong (b34) 2020; 160 Naderi, Ruiz (b41) 2010; 37 Zhang, Li, Cao (b60) 2022; 141 Tan, Terekhov (b50) 2018 Mao, Fu, Huang (b35) 2024; 317 Wu, Liu, Zhao (b56) 2019; 11 Luo, Deng, Gong, Zhang (b32) 2022; 207 Meng, Ren, Zhang (b37) 2020; 8 Fattahi, Mehrabad, Jolai (b13) 2007; 18 Li, Gong, Wang (b27) 2023; 53 Hurink, Jurisch, Thole (b22) 1994; 15 Ziaee (b63) 2014; 67 Zhu, Gong, Peng, Zhang, Huang, Luo, Li (b62) 2023; 224 Naderi, Begen, Zaric, Roshanaei (b39) 2023; 116 Xu, Hu, Luo, Wang, Wu (b58) 2021; 157 Li, Gong, Wang (b26) 2022; 74 Roshanaei, Naderi (b48) 2021; 293 Du, Li, Luo (b11) 2021; 62 Yao, Wang, Wang, Li, Gao, Xia (b59) 2024; 62 Luo, Deng, Gong (b33) 2020; 160 Chen, Wu, Wang, Tong, Yan (b5) 2024; 90 Tang, Fang, Liu (b51) 2022; 120 Dauzère-Pérès, Ding, Shen, Tamssaouet (b8) 2024; 314 Nascimento, Silva, Antunes (b43) 2024; 317 Meng, Zhang, Ren (b38) 2020; 142 Nasirian, Zhang, Costa (b44) 2025; 323 Hooker, Yan, Saraswat (b21) 1995 Roshanaei, Azab, ElMaraghy (b47) 2013; 51 Wan, Fu, Li, Li (b53) 2025; 139 Côté, Haouari, Iori (b7) 2021; 33 Rist, Tilk, Forbes (b45) 2024; 318 Hooker (b18) 2000 Naderi, Roshanaei (b40) 2022; 4 Fazel-Zarandi, Beck (b14) 2012; 24 Tran, Araujo, Beck (b52) 2016; 28 Wang, Liu, Ren (b54) 2021; 293 Zhang, Shao, Shao, Pi, Gao (b61) 2024; 91 Liñán, Ricardez-Sandoval (b29) 2024; 70 Marzouki, Driss, Ghédira (b36) 2018; 126 Chang, Liu (b4) 2017; 28 De Giovanni, Pezzella (b10) 2010; 200 Fragkogios, Qiu, Saharidis (b16) 2024; 317 Hooker, Ottosson (b20) 2003; 96 Lu, Wu, Tan (b31) 2018; 29 Shadlou, Ranjbar, Salari (b49) 2023; 183 Carlier, Pinson (b3) 1989; 35 Côté, Dell’Amico, Iori (b6) 2014; 62 Naderi, Ruiz, Roshanaei (b42) 2023; 35 Dauzère-Pérès, Paulli (b9) 1997; 70 Liu, Wang, Li, Gao (b30) 2023; 126 Heching, Hooker, Kimura (b17) 2019; 53 Hooker (b19) 2007; 55 Li, Duan, Cao (b25) 2018; 6 Forbes, Harris, Jansen (b15) 2024; 312 Liu (10.1016/j.ejor.2025.08.039_b30) 2023; 126 Li (10.1016/j.ejor.2025.08.039_b24) 2022; 34 Li (10.1016/j.ejor.2025.08.039_b28) 2022; 2 Yao (10.1016/j.ejor.2025.08.039_b59) 2024; 62 Shadlou (10.1016/j.ejor.2025.08.039_b49) 2023; 183 Hurink (10.1016/j.ejor.2025.08.039_b22) 1994; 15 Naderi (10.1016/j.ejor.2025.08.039_b41) 2010; 37 Nascimento (10.1016/j.ejor.2025.08.039_b43) 2024; 317 Meng (10.1016/j.ejor.2025.08.039_b37) 2020; 8 Fazel-Zarandi (10.1016/j.ejor.2025.08.039_b14) 2012; 24 Chen (10.1016/j.ejor.2025.08.039_b5) 2024; 90 Wan (10.1016/j.ejor.2025.08.039_b53) 2025; 139 Ziaee (10.1016/j.ejor.2025.08.039_b63) 2014; 67 Fattahi (10.1016/j.ejor.2025.08.039_b13) 2007; 18 Kasapidis (10.1016/j.ejor.2025.08.039_b23) 2025; 320 Naderi (10.1016/j.ejor.2025.08.039_b39) 2023; 116 Zhu (10.1016/j.ejor.2025.08.039_b62) 2023; 224 Zhang (10.1016/j.ejor.2025.08.039_b61) 2024; 91 Xie (10.1016/j.ejor.2025.08.039_b57) 2023; 71 Chang (10.1016/j.ejor.2025.08.039_b4) 2017; 28 Tang (10.1016/j.ejor.2025.08.039_b51) 2022; 120 Hooker (10.1016/j.ejor.2025.08.039_b20) 2003; 96 Naderi (10.1016/j.ejor.2025.08.039_b42) 2023; 35 Liñán (10.1016/j.ejor.2025.08.039_b29) 2024; 70 Tan (10.1016/j.ejor.2025.08.039_b50) 2018 Zhang (10.1016/j.ejor.2025.08.039_b60) 2022; 141 Brandimarte (10.1016/j.ejor.2025.08.039_b2) 1993; 41 Luo (10.1016/j.ejor.2025.08.039_b33) 2020; 160 Li (10.1016/j.ejor.2025.08.039_b25) 2018; 6 Hooker (10.1016/j.ejor.2025.08.039_b21) 1995 Marzouki (10.1016/j.ejor.2025.08.039_b36) 2018; 126 Li (10.1016/j.ejor.2025.08.039_b26) 2022; 74 Roshanaei (10.1016/j.ejor.2025.08.039_b47) 2013; 51 Roshanaei (10.1016/j.ejor.2025.08.039_b46) 2012 Wang (10.1016/j.ejor.2025.08.039_b55) 2024; 167 Baloch (10.1016/j.ejor.2025.08.039_b1) 2020; 54 Li (10.1016/j.ejor.2025.08.039_b27) 2023; 53 Hooker (10.1016/j.ejor.2025.08.039_b19) 2007; 55 Luo (10.1016/j.ejor.2025.08.039_b34) 2020; 160 Tran (10.1016/j.ejor.2025.08.039_b52) 2016; 28 Rist (10.1016/j.ejor.2025.08.039_b45) 2024; 318 Naderi (10.1016/j.ejor.2025.08.039_b40) 2022; 4 Luo (10.1016/j.ejor.2025.08.039_b32) 2022; 207 Côté (10.1016/j.ejor.2025.08.039_b7) 2021; 33 Hooker (10.1016/j.ejor.2025.08.039_b18) 2000 Fan (10.1016/j.ejor.2025.08.039_b12) 2024; 74 Forbes (10.1016/j.ejor.2025.08.039_b15) 2024; 312 Lu (10.1016/j.ejor.2025.08.039_b31) 2018; 29 Wu (10.1016/j.ejor.2025.08.039_b56) 2019; 11 De Giovanni (10.1016/j.ejor.2025.08.039_b10) 2010; 200 Wang (10.1016/j.ejor.2025.08.039_b54) 2021; 293 Carlier (10.1016/j.ejor.2025.08.039_b3) 1989; 35 Xu (10.1016/j.ejor.2025.08.039_b58) 2021; 157 Côté (10.1016/j.ejor.2025.08.039_b6) 2014; 62 Mao (10.1016/j.ejor.2025.08.039_b35) 2024; 317 Heching (10.1016/j.ejor.2025.08.039_b17) 2019; 53 Meng (10.1016/j.ejor.2025.08.039_b38) 2020; 142 Fragkogios (10.1016/j.ejor.2025.08.039_b16) 2024; 317 Dauzère-Pérès (10.1016/j.ejor.2025.08.039_b9) 1997; 70 Dauzère-Pérès (10.1016/j.ejor.2025.08.039_b8) 2024; 314 Roshanaei (10.1016/j.ejor.2025.08.039_b48) 2021; 293 Nasirian (10.1016/j.ejor.2025.08.039_b44) 2025; 323 Du (10.1016/j.ejor.2025.08.039_b11) 2021; 62 |
| References_xml | – volume: 6 start-page: 58883 year: 2018 end-page: 58897 ident: b25 article-title: A hybrid Pareto-based tabu search for the distributed flexible job shop scheduling problem with e/t criteria publication-title: IEEE Access – volume: 41 start-page: 157 year: 1993 end-page: 183 ident: b2 article-title: Routing and scheduling in a flexible job shop by tabu search publication-title: Annals of Operations Research – volume: 167 year: 2024 ident: b55 article-title: Multi-objective scheduling for an energy-efficient flexible job shop problem with peak power constraint publication-title: Applied Soft Computing – volume: 126 year: 2023 ident: b30 article-title: A multi-population co-evolutionary algorithm for green integrated process planning and scheduling considering logistics system publication-title: Engineering Applications of Artificial Intelligence – volume: 51 start-page: 6247 year: 2013 end-page: 6274 ident: b47 article-title: Mathematical modelling and a meta-heuristic for flexible job shop scheduling publication-title: International Journal of Production Research – volume: 120 year: 2022 ident: b51 article-title: A hybrid teaching and learning-based optimization algorithm for distributed sand casting job-shop scheduling problem publication-title: Applied Soft Computing – volume: 200 start-page: 395 year: 2010 end-page: 408 ident: b10 article-title: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem publication-title: European Journal of Operational Research – volume: 53 start-page: 8013 year: 2023 end-page: 8023 ident: b27 article-title: Surprisingly popular-based adaptive memetic algorithm for energy-efficient distributed flexible job shop scheduling publication-title: IEEE Transactions on Cybernetics – volume: 29 start-page: 19 year: 2018 end-page: 34 ident: b31 article-title: A genetic algorithm embedded with a concise chromosome representation for distributed and flexible job-shop scheduling problems publication-title: Journal of Intelligent Manufacturing – volume: 320 start-page: 479 year: 2025 end-page: 495 ident: b23 article-title: A unified solution framework for flexible job shop scheduling problems with multiple resource constraints publication-title: European Journal of Operational Research – volume: 323 start-page: 20 year: 2025 end-page: 33 ident: b44 article-title: Multiskilled workforce staffing and scheduling: A logic-based benders’ decomposition approach publication-title: European Journal of Operational Research – volume: 18 start-page: 331 year: 2007 end-page: 342 ident: b13 article-title: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems publication-title: Journal of Intelligent Manufacturing – year: 2012 ident: b46 article-title: Mathematical modelling and optimization of flexible job shops scheduling problem – volume: 139 year: 2025 ident: b53 article-title: An effective multi-agent-based graph reinforcement learning method for solving flexible job shop scheduling problem publication-title: Engineering Applications of Artificial Intelligence – volume: 141 year: 2022 ident: b60 article-title: On the mass COVID-19 vaccination scheduling problem publication-title: Computers & Operations Research – volume: 33 start-page: 963 year: 2021 end-page: 978 ident: b7 article-title: Combinatorial benders decomposition for the two-dimensional bin packing problem publication-title: INFORMS Journal on Computing – volume: 74 start-page: 180 year: 2024 end-page: 197 ident: b12 article-title: Flexible job shop scheduling with stochastic machine breakdowns by an improved tuna swarm optimization algorithm publication-title: Journal of Manufacturing Systems – year: 1995 ident: b21 article-title: Verifying logic circuits by benders decomposition – volume: 126 start-page: 1424 year: 2018 end-page: 1433 ident: b36 article-title: Solving distributed and flexible job shop scheduling problem using a chemical reaction optimization metaheuristic publication-title: Procedia Computer Science – year: 2000 ident: b18 article-title: Logic-based methods for optimization: combining optimization and constraint satisfaction – volume: 62 start-page: 643 year: 2014 end-page: 661 ident: b6 article-title: Combinatorial benders’ cuts for the strip packing problem publication-title: Operations Research – volume: 224 year: 2023 ident: b62 article-title: Dynamic distributed flexible job-shop scheduling problem considering operation inspection publication-title: Expert Systems with Applications – start-page: 60 year: 2018 end-page: 71 ident: b50 article-title: Logic-based benders decomposition for two-stage flexible flow shop scheduling with unrelated parallel machines publication-title: Advances in artificial intelligence: 31st Canadian conference on artificial intelligence, Canadian AI 2018, toronto, on, Canada, May 8–11, 2018, proceedings 31 – volume: 312 start-page: 840 year: 2024 end-page: 854 ident: b15 article-title: Combining optimisation and simulation using logic-based benders decomposition publication-title: European Journal of Operational Research – volume: 70 year: 2024 ident: b29 article-title: Multicut logic-based benders decomposition for discrete-time scheduling and dynamic optimization of network batch plants publication-title: AIChE Journal – volume: 293 year: 2021 ident: b54 article-title: Evolutionary game based real-time scheduling for energy-efficient distributed and flexible job shop publication-title: Journal of Cleaner Production – volume: 24 start-page: 387 year: 2012 end-page: 398 ident: b14 article-title: Using logic-based benders decomposition to solve the capacity-and distance-constrained plant location problem publication-title: INFORMS Journal on Computing – volume: 34 start-page: 1048 year: 2022 end-page: 1069 ident: b24 article-title: Novel formulations and logic-based benders decomposition for the integrated parallel machine scheduling and location problem publication-title: INFORMS Journal on Computing – volume: 74 year: 2022 ident: b26 article-title: Two-stage knowledge-driven evolutionary algorithm for distributed green flexible job shop scheduling with type-2 fuzzy processing time publication-title: Swarm and Evolutionary Computation – volume: 37 start-page: 754 year: 2010 end-page: 768 ident: b41 article-title: The distributed permutation flowshop scheduling problem publication-title: Computers & Operations Research – volume: 91 year: 2024 ident: b61 article-title: Deep reinforcement learning driven trajectory-based meta-heuristic for distributed heterogeneous flexible job shop scheduling problem publication-title: Swarm and Evolutionary Computation – volume: 90 year: 2024 ident: b5 article-title: A Q-learning based NSGA-II for dynamic flexible job shop scheduling with limited transportation resources publication-title: Swarm and Evolutionary Computation – volume: 317 start-page: 92 year: 2024 end-page: 110 ident: b43 article-title: Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems publication-title: European Journal of Operational Research – volume: 160 year: 2020 ident: b33 article-title: An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers publication-title: Expert Systems with Applications – volume: 35 start-page: 164 year: 1989 end-page: 176 ident: b3 article-title: An algorithm for solving the job-shop problem publication-title: Management Science – volume: 2 start-page: 156 year: 2022 end-page: 173 ident: b28 article-title: Distributed flexible job-shop scheduling problem based on hybrid chemical reaction optimization algorithm publication-title: Complex System Modeling and Simulation – volume: 62 year: 2024 ident: b59 article-title: Knowledge-based multi-objective evolutionary algorithm for energy-efficient flexible job shop scheduling with mobile robot transportation publication-title: Advanced Engineering Informatics – volume: 35 start-page: 817 year: 2023 end-page: 843 ident: b42 article-title: Mixed-integer programming vs. constraint programming for shop scheduling problems: new results and outlook publication-title: INFORMS Journal on Computing – volume: 318 start-page: 836 year: 2024 end-page: 850 ident: b45 article-title: Benders decomposition with delayed disaggregation for the active passive vehicle routing problem publication-title: European Journal of Operational Research – volume: 28 start-page: 1973 year: 2017 end-page: 1986 ident: b4 article-title: Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms publication-title: Journal of Intelligent Manufacturing – volume: 54 start-page: 204 year: 2020 end-page: 228 ident: b1 article-title: Strategic network design for parcel delivery with drones under competition publication-title: Transportation Science – volume: 53 start-page: 510 year: 2019 end-page: 522 ident: b17 article-title: A logic-based benders approach to home healthcare delivery publication-title: Transportation Science – volume: 11 start-page: 335 year: 2019 end-page: 355 ident: b56 article-title: An improved differential evolution algorithm for solving a distributed assembly flexible job shop scheduling problem publication-title: Memetic Computing – volume: 15 start-page: 205 year: 1994 end-page: 215 ident: b22 article-title: Tabu search for the job-shop scheduling problem with multi-purpose machines publication-title: Operations Research Spectrum – volume: 157 year: 2021 ident: b58 article-title: A multi-objective scheduling method for distributed and flexible job shop based on hybrid genetic algorithm and tabu search considering operation outsourcing and carbon emission publication-title: Computers & Industrial Engineering – volume: 314 start-page: 409 year: 2024 end-page: 432 ident: b8 article-title: The flexible job shop scheduling problem: A review publication-title: European Journal of Operational Research – volume: 55 start-page: 588 year: 2007 end-page: 602 ident: b19 article-title: Planning and scheduling by logic-based benders decomposition publication-title: Operations Research – volume: 8 start-page: 191191 year: 2020 end-page: 191203 ident: b37 article-title: MILP modeling and optimization of energy-efficient distributed flexible job shop scheduling problem publication-title: IEEE Access – volume: 116 year: 2023 ident: b39 article-title: A novel and efficient exact technique for integrated staffing, assignment, routing, and scheduling of home care services under uncertainty publication-title: Omega – volume: 67 start-page: 69 year: 2014 end-page: 83 ident: b63 article-title: A heuristic algorithm for the distributed and flexible job-shop scheduling problem publication-title: Journal of Supercomputing – volume: 96 start-page: 33 year: 2003 end-page: 60 ident: b20 article-title: Logic-based benders decomposition publication-title: Mathematical Programming – volume: 142 year: 2020 ident: b38 article-title: Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem publication-title: Computers & Industrial Engineering – volume: 293 start-page: 65 year: 2021 end-page: 78 ident: b48 article-title: Solving integrated operating room planning and scheduling: Logic-based benders decomposition versus Branch-Price-and-Cut publication-title: European Journal of Operational Research – volume: 71 start-page: 82 year: 2023 end-page: 94 ident: b57 article-title: A hybrid genetic tabu search algorithm for distributed flexible job shop scheduling problems publication-title: Journal of Manufacturing Systems – volume: 70 start-page: 281 year: 1997 end-page: 306 ident: b9 article-title: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search publication-title: Annals of Operations Research – volume: 160 year: 2020 ident: b34 article-title: An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers publication-title: Expert Systems with Applications – volume: 62 year: 2021 ident: b11 article-title: A hybrid estimation of distribution algorithm for distributed flexible job shop scheduling with crane transportations publication-title: Swarm and Evolutionary Computation – volume: 317 start-page: 500 year: 2024 end-page: 514 ident: b16 article-title: An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows publication-title: European Journal of Operational Research – volume: 207 year: 2022 ident: b32 article-title: A distributed flexible job shop scheduling problem considering worker arrangement using an improved memetic algorithm publication-title: Expert Systems with Applications – volume: 28 start-page: 83 year: 2016 end-page: 95 ident: b52 article-title: Decomposition methods for the parallel machine scheduling problem with setups publication-title: INFORMS Journal on Computing – volume: 4 start-page: 1 year: 2022 end-page: 28 ident: b40 article-title: Critical-path-search logic-based benders decomposition approaches for flexible job shop scheduling publication-title: INFORMS Journal on Optimization – volume: 317 start-page: 890 year: 2024 end-page: 905 ident: b35 article-title: Combinatorial benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints publication-title: European Journal of Operational Research – volume: 183 year: 2023 ident: b49 article-title: A logic-based benders decomposition algorithm for a repair crew routing and drone scheduling problem after a natural disaster publication-title: Computers & Industrial Engineering – volume: 126 year: 2023 ident: 10.1016/j.ejor.2025.08.039_b30 article-title: A multi-population co-evolutionary algorithm for green integrated process planning and scheduling considering logistics system publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/j.engappai.2023.107030 – volume: 55 start-page: 588 issue: 3 year: 2007 ident: 10.1016/j.ejor.2025.08.039_b19 article-title: Planning and scheduling by logic-based benders decomposition publication-title: Operations Research doi: 10.1287/opre.1060.0371 – volume: 8 start-page: 191191 year: 2020 ident: 10.1016/j.ejor.2025.08.039_b37 article-title: MILP modeling and optimization of energy-efficient distributed flexible job shop scheduling problem publication-title: IEEE Access doi: 10.1109/ACCESS.2020.3032548 – volume: 54 start-page: 204 issue: 1 year: 2020 ident: 10.1016/j.ejor.2025.08.039_b1 article-title: Strategic network design for parcel delivery with drones under competition publication-title: Transportation Science doi: 10.1287/trsc.2019.0928 – volume: 62 start-page: 643 issue: 3 year: 2014 ident: 10.1016/j.ejor.2025.08.039_b6 article-title: Combinatorial benders’ cuts for the strip packing problem publication-title: Operations Research doi: 10.1287/opre.2013.1248 – volume: 51 start-page: 6247 issue: 20 year: 2013 ident: 10.1016/j.ejor.2025.08.039_b47 article-title: Mathematical modelling and a meta-heuristic for flexible job shop scheduling publication-title: International Journal of Production Research doi: 10.1080/00207543.2013.827806 – volume: 96 start-page: 33 issue: 1 year: 2003 ident: 10.1016/j.ejor.2025.08.039_b20 article-title: Logic-based benders decomposition publication-title: Mathematical Programming doi: 10.1007/s10107-003-0375-9 – year: 2000 ident: 10.1016/j.ejor.2025.08.039_b18 – volume: 318 start-page: 836 issue: 3 year: 2024 ident: 10.1016/j.ejor.2025.08.039_b45 article-title: Benders decomposition with delayed disaggregation for the active passive vehicle routing problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2024.05.041 – year: 2012 ident: 10.1016/j.ejor.2025.08.039_b46 – volume: 62 year: 2021 ident: 10.1016/j.ejor.2025.08.039_b11 article-title: A hybrid estimation of distribution algorithm for distributed flexible job shop scheduling with crane transportations publication-title: Swarm and Evolutionary Computation doi: 10.1016/j.swevo.2021.100861 – volume: 53 start-page: 8013 issue: 12 year: 2023 ident: 10.1016/j.ejor.2025.08.039_b27 article-title: Surprisingly popular-based adaptive memetic algorithm for energy-efficient distributed flexible job shop scheduling publication-title: IEEE Transactions on Cybernetics doi: 10.1109/TCYB.2023.3280175 – volume: 157 year: 2021 ident: 10.1016/j.ejor.2025.08.039_b58 article-title: A multi-objective scheduling method for distributed and flexible job shop based on hybrid genetic algorithm and tabu search considering operation outsourcing and carbon emission publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2021.107318 – volume: 207 year: 2022 ident: 10.1016/j.ejor.2025.08.039_b32 article-title: A distributed flexible job shop scheduling problem considering worker arrangement using an improved memetic algorithm publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2022.117984 – volume: 67 start-page: 69 issue: 1 year: 2014 ident: 10.1016/j.ejor.2025.08.039_b63 article-title: A heuristic algorithm for the distributed and flexible job-shop scheduling problem publication-title: Journal of Supercomputing doi: 10.1007/s11227-013-0986-8 – volume: 120 year: 2022 ident: 10.1016/j.ejor.2025.08.039_b51 article-title: A hybrid teaching and learning-based optimization algorithm for distributed sand casting job-shop scheduling problem publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2022.108694 – volume: 24 start-page: 387 issue: 3 year: 2012 ident: 10.1016/j.ejor.2025.08.039_b14 article-title: Using logic-based benders decomposition to solve the capacity-and distance-constrained plant location problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.1110.0458 – volume: 70 start-page: 281 year: 1997 ident: 10.1016/j.ejor.2025.08.039_b9 article-title: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search publication-title: Annals of Operations Research doi: 10.1023/A:1018930406487 – year: 1995 ident: 10.1016/j.ejor.2025.08.039_b21 – volume: 2 start-page: 156 issue: 2 year: 2022 ident: 10.1016/j.ejor.2025.08.039_b28 article-title: Distributed flexible job-shop scheduling problem based on hybrid chemical reaction optimization algorithm publication-title: Complex System Modeling and Simulation doi: 10.23919/CSMS.2022.0010 – volume: 28 start-page: 1973 year: 2017 ident: 10.1016/j.ejor.2025.08.039_b4 article-title: Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms publication-title: Journal of Intelligent Manufacturing doi: 10.1007/s10845-015-1084-y – volume: 317 start-page: 92 issue: 1 year: 2024 ident: 10.1016/j.ejor.2025.08.039_b43 article-title: Optimal decomposition approach for solving large nesting and scheduling problems of additive manufacturing systems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2024.03.004 – volume: 74 start-page: 180 year: 2024 ident: 10.1016/j.ejor.2025.08.039_b12 article-title: Flexible job shop scheduling with stochastic machine breakdowns by an improved tuna swarm optimization algorithm publication-title: Journal of Manufacturing Systems doi: 10.1016/j.jmsy.2024.03.002 – volume: 53 start-page: 510 issue: 2 year: 2019 ident: 10.1016/j.ejor.2025.08.039_b17 article-title: A logic-based benders approach to home healthcare delivery publication-title: Transportation Science doi: 10.1287/trsc.2018.0830 – volume: 141 year: 2022 ident: 10.1016/j.ejor.2025.08.039_b60 article-title: On the mass COVID-19 vaccination scheduling problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2022.105704 – volume: 34 start-page: 1048 issue: 2 year: 2022 ident: 10.1016/j.ejor.2025.08.039_b24 article-title: Novel formulations and logic-based benders decomposition for the integrated parallel machine scheduling and location problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.2021.1113 – volume: 74 year: 2022 ident: 10.1016/j.ejor.2025.08.039_b26 article-title: Two-stage knowledge-driven evolutionary algorithm for distributed green flexible job shop scheduling with type-2 fuzzy processing time publication-title: Swarm and Evolutionary Computation doi: 10.1016/j.swevo.2022.101139 – volume: 11 start-page: 335 year: 2019 ident: 10.1016/j.ejor.2025.08.039_b56 article-title: An improved differential evolution algorithm for solving a distributed assembly flexible job shop scheduling problem publication-title: Memetic Computing doi: 10.1007/s12293-018-00278-7 – volume: 35 start-page: 164 issue: 2 year: 1989 ident: 10.1016/j.ejor.2025.08.039_b3 article-title: An algorithm for solving the job-shop problem publication-title: Management Science doi: 10.1287/mnsc.35.2.164 – volume: 6 start-page: 58883 year: 2018 ident: 10.1016/j.ejor.2025.08.039_b25 article-title: A hybrid Pareto-based tabu search for the distributed flexible job shop scheduling problem with e/t criteria publication-title: IEEE Access doi: 10.1109/ACCESS.2018.2873401 – volume: 29 start-page: 19 year: 2018 ident: 10.1016/j.ejor.2025.08.039_b31 article-title: A genetic algorithm embedded with a concise chromosome representation for distributed and flexible job-shop scheduling problems publication-title: Journal of Intelligent Manufacturing doi: 10.1007/s10845-015-1083-z – volume: 62 year: 2024 ident: 10.1016/j.ejor.2025.08.039_b59 article-title: Knowledge-based multi-objective evolutionary algorithm for energy-efficient flexible job shop scheduling with mobile robot transportation publication-title: Advanced Engineering Informatics doi: 10.1016/j.aei.2024.102647 – volume: 28 start-page: 83 issue: 1 year: 2016 ident: 10.1016/j.ejor.2025.08.039_b52 article-title: Decomposition methods for the parallel machine scheduling problem with setups publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.2015.0666 – volume: 116 year: 2023 ident: 10.1016/j.ejor.2025.08.039_b39 article-title: A novel and efficient exact technique for integrated staffing, assignment, routing, and scheduling of home care services under uncertainty publication-title: Omega doi: 10.1016/j.omega.2022.102805 – volume: 293 year: 2021 ident: 10.1016/j.ejor.2025.08.039_b54 article-title: Evolutionary game based real-time scheduling for energy-efficient distributed and flexible job shop publication-title: Journal of Cleaner Production doi: 10.1016/j.jclepro.2021.126093 – volume: 4 start-page: 1 issue: 1 year: 2022 ident: 10.1016/j.ejor.2025.08.039_b40 article-title: Critical-path-search logic-based benders decomposition approaches for flexible job shop scheduling publication-title: INFORMS Journal on Optimization doi: 10.1287/ijoo.2021.0056 – volume: 317 start-page: 890 issue: 3 year: 2024 ident: 10.1016/j.ejor.2025.08.039_b35 article-title: Combinatorial benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2024.05.001 – volume: 90 year: 2024 ident: 10.1016/j.ejor.2025.08.039_b5 article-title: A Q-learning based NSGA-II for dynamic flexible job shop scheduling with limited transportation resources publication-title: Swarm and Evolutionary Computation doi: 10.1016/j.swevo.2024.101658 – volume: 293 start-page: 65 issue: 1 year: 2021 ident: 10.1016/j.ejor.2025.08.039_b48 article-title: Solving integrated operating room planning and scheduling: Logic-based benders decomposition versus Branch-Price-and-Cut publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2020.12.004 – volume: 71 start-page: 82 year: 2023 ident: 10.1016/j.ejor.2025.08.039_b57 article-title: A hybrid genetic tabu search algorithm for distributed flexible job shop scheduling problems publication-title: Journal of Manufacturing Systems doi: 10.1016/j.jmsy.2023.09.002 – volume: 160 year: 2020 ident: 10.1016/j.ejor.2025.08.039_b34 article-title: An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2020.113721 – volume: 126 start-page: 1424 year: 2018 ident: 10.1016/j.ejor.2025.08.039_b36 article-title: Solving distributed and flexible job shop scheduling problem using a chemical reaction optimization metaheuristic publication-title: Procedia Computer Science doi: 10.1016/j.procs.2018.08.114 – volume: 320 start-page: 479 issue: 3 year: 2025 ident: 10.1016/j.ejor.2025.08.039_b23 article-title: A unified solution framework for flexible job shop scheduling problems with multiple resource constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2024.08.010 – volume: 314 start-page: 409 issue: 2 year: 2024 ident: 10.1016/j.ejor.2025.08.039_b8 article-title: The flexible job shop scheduling problem: A review publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2023.05.017 – volume: 224 year: 2023 ident: 10.1016/j.ejor.2025.08.039_b62 article-title: Dynamic distributed flexible job-shop scheduling problem considering operation inspection publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2023.119840 – start-page: 60 year: 2018 ident: 10.1016/j.ejor.2025.08.039_b50 article-title: Logic-based benders decomposition for two-stage flexible flow shop scheduling with unrelated parallel machines – volume: 312 start-page: 840 issue: 3 year: 2024 ident: 10.1016/j.ejor.2025.08.039_b15 article-title: Combining optimisation and simulation using logic-based benders decomposition publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2023.07.032 – volume: 70 issue: 9 year: 2024 ident: 10.1016/j.ejor.2025.08.039_b29 article-title: Multicut logic-based benders decomposition for discrete-time scheduling and dynamic optimization of network batch plants publication-title: AIChE Journal doi: 10.1002/aic.18491 – volume: 37 start-page: 754 issue: 4 year: 2010 ident: 10.1016/j.ejor.2025.08.039_b41 article-title: The distributed permutation flowshop scheduling problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2009.06.019 – volume: 160 year: 2020 ident: 10.1016/j.ejor.2025.08.039_b33 article-title: An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2020.113721 – volume: 15 start-page: 205 year: 1994 ident: 10.1016/j.ejor.2025.08.039_b22 article-title: Tabu search for the job-shop scheduling problem with multi-purpose machines publication-title: Operations Research Spectrum doi: 10.1007/BF01719451 – volume: 183 year: 2023 ident: 10.1016/j.ejor.2025.08.039_b49 article-title: A logic-based benders decomposition algorithm for a repair crew routing and drone scheduling problem after a natural disaster publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2023.109542 – volume: 200 start-page: 395 issue: 2 year: 2010 ident: 10.1016/j.ejor.2025.08.039_b10 article-title: An improved genetic algorithm for the distributed and flexible job-shop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.01.008 – volume: 323 start-page: 20 issue: 1 year: 2025 ident: 10.1016/j.ejor.2025.08.039_b44 article-title: Multiskilled workforce staffing and scheduling: A logic-based benders’ decomposition approach publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2024.11.033 – volume: 41 start-page: 157 issue: 3 year: 1993 ident: 10.1016/j.ejor.2025.08.039_b2 article-title: Routing and scheduling in a flexible job shop by tabu search publication-title: Annals of Operations Research doi: 10.1007/BF02023073 – volume: 18 start-page: 331 year: 2007 ident: 10.1016/j.ejor.2025.08.039_b13 article-title: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems publication-title: Journal of Intelligent Manufacturing doi: 10.1007/s10845-007-0026-8 – volume: 35 start-page: 817 issue: 4 year: 2023 ident: 10.1016/j.ejor.2025.08.039_b42 article-title: Mixed-integer programming vs. constraint programming for shop scheduling problems: new results and outlook publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.2023.1287 – volume: 139 year: 2025 ident: 10.1016/j.ejor.2025.08.039_b53 article-title: An effective multi-agent-based graph reinforcement learning method for solving flexible job shop scheduling problem publication-title: Engineering Applications of Artificial Intelligence doi: 10.1016/j.engappai.2024.109557 – volume: 167 year: 2024 ident: 10.1016/j.ejor.2025.08.039_b55 article-title: Multi-objective scheduling for an energy-efficient flexible job shop problem with peak power constraint publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2024.112330 – volume: 91 year: 2024 ident: 10.1016/j.ejor.2025.08.039_b61 article-title: Deep reinforcement learning driven trajectory-based meta-heuristic for distributed heterogeneous flexible job shop scheduling problem publication-title: Swarm and Evolutionary Computation doi: 10.1016/j.swevo.2024.101753 – volume: 142 year: 2020 ident: 10.1016/j.ejor.2025.08.039_b38 article-title: Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2020.106347 – volume: 33 start-page: 963 issue: 3 year: 2021 ident: 10.1016/j.ejor.2025.08.039_b7 article-title: Combinatorial benders decomposition for the two-dimensional bin packing problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.2020.1014 – volume: 317 start-page: 500 issue: 2 year: 2024 ident: 10.1016/j.ejor.2025.08.039_b16 article-title: An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2024.04.013 |
| SSID | ssj0001515 |
| Score | 2.4854164 |
| Snippet | The Distributed Flexible Job Shop Scheduling Problem (DFJSP) is a well-known NP-hard optimization problem with widespread applications in production... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| SubjectTerms | Constraint programming Distributed flexible job shop scheduling problem Local search Logic-based benders decomposition Mixed integer linear programming |
| Title | Logic-based benders decomposition methods for the distributed flexible job shop scheduling problem |
| URI | https://dx.doi.org/10.1016/j.ejor.2025.08.039 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0001515 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1daxQxFA3aitiHqqti_SIPvi2RaWYymTyWUqkiRbDCvg2TL919mF12ttKf772TO9O1VVHBl2EZSAZyQu7J3XvPYex1HnMVbVmIqIMTRWNzYZ2NAkJxUJVHybS-UfiDPjurZjPzkdzsu95OQLdtdXlpVv8VangHYGPr7F_APU4KL-A3gA5PgB2efwQ8uic7gdEJuGVvFNdNfcDScarPItfobqww9Ciei75XMCKiQCZ2Uy2Wdtp9Xa6mcP2FcERd6737zC-z-cRs4cV6yDGSmNCYdJ7NqQYY7r7zsRpofpFCYPsFTmOKpZSKkGqstaL82I0emdSXpbWQMnVo3jiwU-5g8SYslqjOKlUvqJr0ja4JYX_CmXAiYG0ZVubeZrtSKwNn2e7Ru5PZ-zECI0nr_z2iL1OzVKrru_6lnxOSLZJx_oDt0-2AHyVUH7JboZ2wu0NzwoTdH0w4OJ3JE7a3pSj5iNkt9Dmhz39AnxP6HNDngD7fQp8P6HNAnyP6_Ap9Tug_Zp_fnpwfnwqy0RDusKw2Ao2Lq9L7MouFsRYYrfWHWRaNB-pbxqCjjU4aV6gmaulkA5d-mRfBNI3OpPP5E7bTLtvwlHFfSRNtYxQwuwKl_JTPQoaOAbIKZfQHbDqsZb1Kain1UEa4qHHla1z5Gp1Pc3PA1LDcNfG9xONq2B2_GffsH8c9Z_eudu0LtrNZX4SX7I77tpl361e0ib4DTzJ_Jg |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Logic-based+benders+decomposition+methods+for+the+distributed+flexible+job+shop+scheduling+problem&rft.jtitle=European+journal+of+operational+research&rft.au=Xiong%2C+Fuli&rft.au=Liu%2C+Hengchong&rft.date=2025-09-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft_id=info:doi/10.1016%2Fj.ejor.2025.08.039&rft.externalDocID=S0377221725006769 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |