Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
•A Dantzig-Wolfe formulation by machine decomposition is constructed.•A set-oriented data-driven branching and selection algorithm is proposed.•Numerical experiments justify the incorporation of the statistical estimation model. The capacitated lot-sizing and machine scheduling problem with sequence...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research Jg. 132; S. 105289 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
Elsevier Ltd
01.08.2021
Pergamon Press Inc |
| Schlagworte: | |
| ISSN: | 0305-0548, 0305-0548 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •A Dantzig-Wolfe formulation by machine decomposition is constructed.•A set-oriented data-driven branching and selection algorithm is proposed.•Numerical experiments justify the incorporation of the statistical estimation model.
The capacitated lot-sizing and machine scheduling problem with sequence-dependent setup time and setup carryover is a challenging problem with a wide application in industries. For the problem, two mixed integer programming models are proposed in order to explore their relative efficiencies in obtaining optimal solutions and linear programming relaxation lower bounds. Furthermore, due to the fact that the complicating constraints involve pairs of items (the sequence-dependent setups) and pairs of consecutive periods (the setup carryovers), making it difficult to decompose the problem per item or per period, we instead present a Dantzig-Wolfe decomposition reformulation per machine to improve lower bounds. We propose a branching and selection method to solve the problem, in which a collection of variables rather than individual variables are put into a data-driven process to generate useful information which is then adopted in the branching and selection process. Extensive numerical experiments show that the proposed algorithm can obtain numerically near-optimal solutions for small-scale problems and outperforms CPLEX and other heuristics in terms of both solution quality and runtime when the scale of instances increases. More experiments have been conducted to extract some insightful features related to the model and algorithm. |
|---|---|
| AbstractList | •A Dantzig-Wolfe formulation by machine decomposition is constructed.•A set-oriented data-driven branching and selection algorithm is proposed.•Numerical experiments justify the incorporation of the statistical estimation model.
The capacitated lot-sizing and machine scheduling problem with sequence-dependent setup time and setup carryover is a challenging problem with a wide application in industries. For the problem, two mixed integer programming models are proposed in order to explore their relative efficiencies in obtaining optimal solutions and linear programming relaxation lower bounds. Furthermore, due to the fact that the complicating constraints involve pairs of items (the sequence-dependent setups) and pairs of consecutive periods (the setup carryovers), making it difficult to decompose the problem per item or per period, we instead present a Dantzig-Wolfe decomposition reformulation per machine to improve lower bounds. We propose a branching and selection method to solve the problem, in which a collection of variables rather than individual variables are put into a data-driven process to generate useful information which is then adopted in the branching and selection process. Extensive numerical experiments show that the proposed algorithm can obtain numerically near-optimal solutions for small-scale problems and outperforms CPLEX and other heuristics in terms of both solution quality and runtime when the scale of instances increases. More experiments have been conducted to extract some insightful features related to the model and algorithm. The capacitated lot-sizing and machine scheduling problem with sequence-dependent setup time and setup carryover is a challenging problem with a wide application in industries. For the problem, two mixed integer programming models are proposed in order to explore their relative efficiencies in obtaining optimal solutions and linear programming relaxation lower bounds. Furthermore, due to the fact that the complicating constraints involve pairs of items (the sequence-dependent setups) and pairs of consecutive periods (the setup carryovers), making it difficult to decompose the problem per item or per period, we instead present a Dantzig-Wolfe decomposition reformulation per machine to improve lower bounds. We propose a branching and selection method to solve the problem, in which a collection of variables rather than individual variables are put into a data-driven process to generate useful information which is then adopted in the branching and selection process. Extensive numerical experiments show that the proposed algorithm can obtain numerically near-optimal solutions for small-scale problems and outperforms CPLEX and other heuristics in terms of both solution quality and runtime when the scale of instances increases. More experiments have been conducted to extract some insightful features related to the model and algorithm. |
| ArticleNumber | 105289 |
| Author | Wu, Tao Zhang, Dandan Zhang, Canrong |
| Author_xml | – sequence: 1 givenname: Canrong surname: Zhang fullname: Zhang, Canrong organization: Division of Logistics and Transportation, Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China – sequence: 2 givenname: Dandan surname: Zhang fullname: Zhang, Dandan organization: Division of Logistics and Transportation, Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China – sequence: 3 givenname: Tao surname: Wu fullname: Wu, Tao email: danielwu9999@gmail.com organization: School of Economics & Management, Tongji University, Shanghai 200092, China |
| BookMark | eNp9kE1rAyEQQKWk0CTtD-htoedN1V3jLj2V9BMCvbRncXW2MWw0VZOSQv97XRJK6SGCOKPzRn0jNLDOAkKXBE8IJtPr5UQ5P6GYkpQzWtUnaIgLzHLMymrwJz5DoxCWOA1OyRB938koc-3NFmzWeGnVwtj3TFqdBehAReNs1jqfdS7mwXz9HqoF6E3Xp2vvmg5WIfs0cZGojw1YBbmGNVgNNqatuFmHQ88UZkp6v3Nb8OfotJVdgIvDOkZvD_evs6d8_vL4PLud56pgPOYS15jXvCIYZMm4lnWrGRQNLhTnuORU8pZWjWpqTehUYyIl123TNtNK4WaqizG62vdNb03PC1Es3cbbdKWgrGRpEspSFd9XKe9C8NAKZaLsDUQvTScIFr1rsRTJtehdi73rRJJ_5NqblfS7o8zNnoH08a0BL4IyvTltfPIutDNH6B-_5Zvo |
| CitedBy_id | crossref_primary_10_1016_j_cie_2024_110503 crossref_primary_10_1016_j_engappai_2022_105676 crossref_primary_10_1007_s43069_023_00207_6 crossref_primary_10_1108_JWL_01_2023_0008 crossref_primary_10_1016_j_cie_2024_109985 crossref_primary_10_1108_AA_01_2022_0004 crossref_primary_10_1016_j_jer_2023_100145 crossref_primary_10_1080_23270012_2025_2472371 crossref_primary_10_1016_j_cor_2025_107218 crossref_primary_10_1016_j_ejor_2021_11_020 crossref_primary_10_1016_j_cor_2024_106962 crossref_primary_10_1016_j_eswa_2022_117916 crossref_primary_10_3390_su14095072 crossref_primary_10_1016_j_ejor_2024_11_039 crossref_primary_10_1080_00207543_2023_2253311 crossref_primary_10_1016_j_cie_2022_108041 crossref_primary_10_1016_j_omega_2025_103386 |
| Cites_doi | 10.1080/00207540500066762 10.1080/00207543.2016.1234083 10.1287/ijoc.2016.0723 10.1016/j.orl.2003.06.001 10.1287/opre.35.6.832 10.1016/0377-2217(90)90245-7 10.1016/j.ejor.2019.03.001 10.1016/j.cor.2019.05.023 10.1287/ijoc.2017.0777 10.1287/ijoc.2016.0712 10.1016/j.cor.2011.02.005 10.1016/j.cor.2014.08.022 10.1287/mnsc.5.1.89 10.1080/00207543.2010.535043 10.1287/mnsc.26.7.669 10.1016/S0305-0483(03)00059-8 10.1016/j.ejor.2017.08.021 10.1007/s00291-015-0429-4 10.1016/j.cor.2019.03.007 10.1287/ijoc.2014.0636 10.1287/ijoc.2017.0746 10.1007/s10479-012-1118-1 10.1287/opre.1070.0404 10.1016/j.cor.2021.105255 10.1080/00207543.2011.616236 10.1016/j.cor.2020.104978 10.1016/j.tre.2019.06.012 10.1080/00207543.2013.790570 10.1016/j.ejor.2006.01.053 10.1016/j.cor.2021.105234 10.1007/BF01580738 10.1016/j.cor.2015.04.015 10.1287/mnsc.4.2.115 10.1080/10556788.2015.1043604 10.1016/j.cor.2005.09.008 10.1016/j.cie.2017.07.014 10.1016/j.cor.2013.01.021 10.1080/00207541003690074 10.1007/s10489-014-0626-x 10.1016/j.cor.2015.04.010 10.1016/S0305-0548(99)00055-6 10.1016/j.advengsoft.2012.11.019 10.1002/nav.20345 10.1287/mnsc.45.2.273 10.1007/s00291-012-0283-6 10.1016/S0925-5273(99)00119-X 10.1016/j.ejor.2005.12.008 10.1287/mnsc.30.10.1255 10.1080/00207540601094465 10.1016/j.cor.2019.07.005 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier Ltd Copyright Pergamon Press Inc. Aug 2021 |
| Copyright_xml | – notice: 2021 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Aug 2021 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2021.105289 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 0305-0548 |
| ExternalDocumentID | 10_1016_j_cor_2021_105289 S0305054821000812 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIKJ AAKOC AALRI AAOAW AAQXK AARIN AAXKI AAXUO AAYFN AAYOK ABAOU ABBOA ABDPE ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACRPL ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD ADNMO AEBSH AEFWE AEHXG AEIPS AEKER AENEX AFFNX AFJKZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XPP ZMT ~02 ~G- 9DU AATTM AAYWO AAYXX ACLOT ACVFH ADCNI AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP CITATION EFKBS EFLBG ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c357t-a090797810ea457da9fd5e3b03c770472a7f28bcb9d126d01aa7dfbfb68c0b6d3 |
| ISICitedReferencesCount | 17 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000694869900014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Wed Nov 19 05:30:11 EST 2025 Sat Nov 29 03:23:43 EST 2025 Tue Nov 18 21:05:09 EST 2025 Sat Jan 18 16:10:18 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Lot-sizing Column generation Parallel machine scheduling Data-driven Branching and selection |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c357t-a090797810ea457da9fd5e3b03c770472a7f28bcb9d126d01aa7dfbfb68c0b6d3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2545254125 |
| PQPubID | 45870 |
| ParticipantIDs | proquest_journals_2545254125 crossref_citationtrail_10_1016_j_cor_2021_105289 crossref_primary_10_1016_j_cor_2021_105289 elsevier_sciencedirect_doi_10_1016_j_cor_2021_105289 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-08-01 |
| PublicationDateYYYYMMDD | 2021-08-01 |
| PublicationDate_xml | – month: 08 year: 2021 text: 2021-08-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2021 |
| Publisher | Elsevier Ltd Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc |
| References | Shen, Dauzere-Peres, Neufeld (b0195) 2018; 265 Barany, Vanroy, Wolsey (b0030) 1984; 30 Krarup, Bilde (b0155) 1977 Randa, Doğru, Iyigun, Özen (b0190) 2019; 109 Wu, Shi (b0220) 2011; 49 Copil, Worbelauer, Meyr, Tempelmeier (b0050) 2017; 39 Wu, Xiao, Zhang, Zhang, Liang (b0230) 2019; 129 Fiorotto, D.J., Jans, R., de Araujo, S.A., 2021. Integrated lot sizing and blending problems. Comput. Oper. Res. (in press). Quadt, Kuhn (b0185) 2010; 56 Wagner, Whitin (b0200) 1958; 5 Yang, Low, Zhang, Zheng, Miao (b0250) 2017; 55 Zhang, Prajapati, Peden (b0265) 2011; 49 Xiao, Zhang, Zheng, Gupta (b0245) 2013; 51 Goren, Tunali (b0100) 2015; 42 James, Almada-Lobo (b0120) 2011; 38 Jing, Mu (b0140) 2020; 122 Haase, Kimms (b0110) 2000; 66 de Araujo, De Reyck, Degraeve, Fragkos, Jans (b0055) 2015; 27 Zhang, Chen (b0260) 2012; 50 French, Wilson (b0085) 2007; 34 Akartunalı K, Fragkos I, Miller A J, and Wu T (2016). Local cuts and two-period convex hull closures for big-bucket lot-sizing problems. INFORMS Journal on Computing, 28(4): 766-780. Cárdenas-Barrón, Melob, Santos (b0035) 2021; 130 Jans, Degraeve (b0130) 2007; 177 Helber, Sahling, Schimmelpfeng (b0115) 2013; 35 Kang, Malik, Thomas (b0145) 1999; 45 Wu, T., Akartunalı, K., Jans, R., Liang, Z., 2017. Progressive selection method for the coupled lot-sizing and cutting-stock problem. INFORMS J. Comput. 29(3), 523–543. Alvarez, Louveaux, Wehenkel (b0025) 2017; 29 Xiao, Yang, Zhang, Zheng, Gupta (b0240) 2015; 63 Li, Hu (b0160) 2017; 111 Jing, Mu (b0135) 2019; 110 Pochet, Wolsey (b0170) 1988; 40 Chen, Song, Shi, Pi, Sun (b0045) 2013; 203 Degraeve, Jans (b0060) 2007; 55 Almada-lobo, B., Klabjan, D., Carravilla, M.A., Oliveira, J.F., 2007. Single machine multi-product capacitated lot sizing with sequence-dependent setups. Int. J. Prod. Res. 45(20), 4873–4894. Fleischmann (b0080) 1990; 44 Wu, Shi, Liang, Zhang, Zhang (b0225) 2020; 124 Gicquel, Minoux (b0095) 2015; 54 Eppen, Martin (b0065) 1987; 35 Manne (b0165) 1958; 4 Fiorotto, de Araujo, Jans (b0070) 2015; 63 Wu, Liang, Zhang (b0215) 2018; 30 Ye, Pan (b0255) 2015; 30 Abboud, Jaber, Noueihed (b0005) 2000; 27 Wei, Qi, Wu, Zhang (b0205) 2019; 277 Gruson, Bazrafshan, Cordeau, Jans (b0105) 2019; 111 Pochet, Wolsey (b0175) 1995; 20 Florian, Lenstra, Rinnooy Kan (b0090) 1980; 26 Karimi, Ghomi, Wilson (b0150) 2003; 31 Wu, Zhang, Liang, Leung (b0235) 2013; 40 Quadt, Kuhn (b0180) 2005; 43 Jans, Degraeve (b0125) 2004; 32 Absi, Kedad-Sidhoum (b0010) 2008; 185 Chen, Huang (b0040) 2013; 66 Chen (10.1016/j.cor.2021.105289_b0045) 2013; 203 Degraeve (10.1016/j.cor.2021.105289_b0060) 2007; 55 Wei (10.1016/j.cor.2021.105289_b0205) 2019; 277 Xiao (10.1016/j.cor.2021.105289_b0245) 2013; 51 Quadt (10.1016/j.cor.2021.105289_b0185) 2010; 56 Wu (10.1016/j.cor.2021.105289_b0225) 2020; 124 Alvarez (10.1016/j.cor.2021.105289_b0025) 2017; 29 Wu (10.1016/j.cor.2021.105289_b0230) 2019; 129 Yang (10.1016/j.cor.2021.105289_b0250) 2017; 55 Zhang (10.1016/j.cor.2021.105289_b0265) 2011; 49 Jing (10.1016/j.cor.2021.105289_b0140) 2020; 122 James (10.1016/j.cor.2021.105289_b0120) 2011; 38 Chen (10.1016/j.cor.2021.105289_b0040) 2013; 66 Karimi (10.1016/j.cor.2021.105289_b0150) 2003; 31 Manne (10.1016/j.cor.2021.105289_b0165) 1958; 4 Li (10.1016/j.cor.2021.105289_b0160) 2017; 111 Wu (10.1016/j.cor.2021.105289_b0235) 2013; 40 Kang (10.1016/j.cor.2021.105289_b0145) 1999; 45 Gicquel (10.1016/j.cor.2021.105289_b0095) 2015; 54 French (10.1016/j.cor.2021.105289_b0085) 2007; 34 Pochet (10.1016/j.cor.2021.105289_b0175) 1995; 20 Krarup (10.1016/j.cor.2021.105289_b0155) 1977 Fleischmann (10.1016/j.cor.2021.105289_b0080) 1990; 44 Cárdenas-Barrón (10.1016/j.cor.2021.105289_b0035) 2021; 130 Absi (10.1016/j.cor.2021.105289_b0010) 2008; 185 Gruson (10.1016/j.cor.2021.105289_b0105) 2019; 111 10.1016/j.cor.2021.105289_b0075 Florian (10.1016/j.cor.2021.105289_b0090) 1980; 26 Xiao (10.1016/j.cor.2021.105289_b0240) 2015; 63 Goren (10.1016/j.cor.2021.105289_b0100) 2015; 42 Pochet (10.1016/j.cor.2021.105289_b0170) 1988; 40 Barany (10.1016/j.cor.2021.105289_b0030) 1984; 30 Jing (10.1016/j.cor.2021.105289_b0135) 2019; 110 de Araujo (10.1016/j.cor.2021.105289_b0055) 2015; 27 Helber (10.1016/j.cor.2021.105289_b0115) 2013; 35 Fiorotto (10.1016/j.cor.2021.105289_b0070) 2015; 63 Shen (10.1016/j.cor.2021.105289_b0195) 2018; 265 Eppen (10.1016/j.cor.2021.105289_b0065) 1987; 35 10.1016/j.cor.2021.105289_b0020 Randa (10.1016/j.cor.2021.105289_b0190) 2019; 109 Haase (10.1016/j.cor.2021.105289_b0110) 2000; 66 Wu (10.1016/j.cor.2021.105289_b0215) 2018; 30 Ye (10.1016/j.cor.2021.105289_b0255) 2015; 30 Quadt (10.1016/j.cor.2021.105289_b0180) 2005; 43 Abboud (10.1016/j.cor.2021.105289_b0005) 2000; 27 Jans (10.1016/j.cor.2021.105289_b0130) 2007; 177 10.1016/j.cor.2021.105289_b0015 Copil (10.1016/j.cor.2021.105289_b0050) 2017; 39 Wagner (10.1016/j.cor.2021.105289_b0200) 1958; 5 10.1016/j.cor.2021.105289_b0210 Wu (10.1016/j.cor.2021.105289_b0220) 2011; 49 Zhang (10.1016/j.cor.2021.105289_b0260) 2012; 50 Jans (10.1016/j.cor.2021.105289_b0125) 2004; 32 |
| References_xml | – volume: 50 start-page: 4631 year: 2012 end-page: 4634 ident: b0260 article-title: A note on ‘A new dynamic programming formulation of (n publication-title: Int. J. Prod. Res. – volume: 30 start-page: 236 year: 2018 end-page: 258 ident: b0215 article-title: Analytics branching and selection for the capacitated multi-item lot sizing problem with non-identical machines publication-title: INFORMS J. Comput. – volume: 29 start-page: 185 year: 2017 end-page: 195 ident: b0025 article-title: A machine learning-based approximation of strong branching publication-title: INFORMS J. Comput. – volume: 26 start-page: 669 year: 1980 end-page: 679 ident: b0090 article-title: Deterministic production planning: algorithms and complexity publication-title: Manage. Sci. – volume: 34 start-page: 2359 year: 2007 end-page: 2369 ident: b0085 article-title: An LP-based heuristic procedure for the generalized assignment problem with special ordered sets publication-title: Comput. Oper. Res. – volume: 42 start-page: 805 year: 2015 end-page: 816 ident: b0100 article-title: Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach publication-title: Appl. Intell. – volume: 45 start-page: 273 year: 1999 end-page: 289 ident: b0145 article-title: Lotsizing and scheduling on parallel machines with sequence-dependent setup costs publication-title: Manage. Sci. – reference: Fiorotto, D.J., Jans, R., de Araujo, S.A., 2021. Integrated lot sizing and blending problems. Comput. Oper. Res. (in press). – reference: Akartunalı K, Fragkos I, Miller A J, and Wu T (2016). Local cuts and two-period convex hull closures for big-bucket lot-sizing problems. INFORMS Journal on Computing, 28(4): 766-780. – start-page: 155 year: 1977 end-page: 179 ident: b0155 article-title: Plant location, set covering and economic lot sizes: an O(mn) algorithm for structured problems publication-title: Optimierung bei Graphentheoretischen and Ganzzahligen Probleme – volume: 5 start-page: 89 year: 1958 end-page: 96 ident: b0200 article-title: Dynamic version of the economic lot size model publication-title: Manage. Sci. – volume: 110 start-page: 77 year: 2019 end-page: 87 ident: b0135 article-title: Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories publication-title: Comput. Oper. Res. – volume: 40 start-page: 317 year: 1988 end-page: 335 ident: b0170 article-title: Lot-size models with backlogging: strong reformulations and cutting planes publication-title: Math. Program. – volume: 38 start-page: 1816 year: 2011 end-page: 1825 ident: b0120 article-title: Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics publication-title: Comput. Oper. Res. – volume: 35 start-page: 832 year: 1987 end-page: 848 ident: b0065 article-title: Solving multi-item capacitated lot-sizing problems using variable redefinition publication-title: Oper. Res. – volume: 66 start-page: 159 year: 2000 end-page: 169 ident: b0110 article-title: Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities publication-title: Int. J. Prod. Econ. – volume: 4 start-page: 115 year: 1958 end-page: 135 ident: b0165 article-title: Programming or economic lot sizes publication-title: Manage. Sci. – volume: 177 start-page: 1855 year: 2007 end-page: 1875 ident: b0130 article-title: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches publication-title: Eur. J. Oper. Res. – reference: Almada-lobo, B., Klabjan, D., Carravilla, M.A., Oliveira, J.F., 2007. Single machine multi-product capacitated lot sizing with sequence-dependent setups. Int. J. Prod. Res. 45(20), 4873–4894. – volume: 124 start-page: 1 year: 2020 end-page: 19 ident: b0225 article-title: Dantzig-Wolfe decomposition for the facility location and production planning problem publication-title: Comput. Oper. Res. – volume: 40 start-page: 1852 year: 2013 end-page: 1863 ident: b0235 article-title: A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders publication-title: Comput. Oper. Res. – volume: 63 start-page: 136 year: 2015 end-page: 148 ident: b0070 article-title: Hybrid methods for lot sizing on parallel machines publication-title: Comput. Oper. Res. – volume: 55 start-page: 909 year: 2007 end-page: 920 ident: b0060 article-title: A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times publication-title: Oper. Res. – volume: 44 start-page: 337 year: 1990 end-page: 348 ident: b0080 article-title: The discrete lot-sizing and scheduling problem publication-title: Eur. J. Oper. Res. – volume: 129 start-page: 15 year: 2019 end-page: 37 ident: b0230 article-title: Regression and extrapolation guided optimization for production-distribution with ship-buy-exchange options publication-title: Transp. Res. Part E – volume: 265 start-page: 503 year: 2018 end-page: 516 ident: b0195 article-title: Solving the flexible job shop scheduling problem with sequence-dependent setup times publication-title: Eur. J. Oper. Res. – volume: 30 start-page: 1255 year: 2015 end-page: 1275 ident: b0255 article-title: A novel sequential approximate optimization approach using data mining for engineering design optimization publication-title: Optim. Methods Software – volume: 54 start-page: 12 year: 2015 end-page: 20 ident: b0095 article-title: Multi-product valid inequalities for the discrete lot-sizing and scheduling problem publication-title: Comput. Oper. Res. – volume: 63 start-page: 72 year: 2015 end-page: 82 ident: b0240 article-title: A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times publication-title: Comput. Oper. Res. – volume: 277 start-page: 521 year: 2019 end-page: 541 ident: b0205 article-title: Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials publication-title: Eur. J. Oper. Res. – volume: 35 start-page: 75 year: 2013 end-page: 105 ident: b0115 article-title: Dynamic capacitated lot sizing with random demand and dynamic safety stocks publication-title: OR Spectrum – volume: 51 start-page: 5011 year: 2013 end-page: 5028 ident: b0245 article-title: MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem publication-title: Int. J. Prod. Res. – volume: 32 start-page: 185 year: 2004 end-page: 195 ident: b0125 article-title: Improved lower bounds for the capacitated lot sizing problem with setup times publication-title: Oper. Res. Lett. – volume: 20 start-page: 173 year: 1995 end-page: 181 ident: b0175 article-title: Algorithms and reformulations for lot sizing problems publication-title: Core Discussion Papers – volume: 55 start-page: 3058 year: 2017 end-page: 3072 ident: b0250 article-title: Behaviour perception-based disruption models for the parallel machine capacitated lot-sizing and scheduling problem publication-title: Int. J. Prod. Res. – volume: 43 start-page: 2291 year: 2005 end-page: 2308 ident: b0180 article-title: Conceptual framework for lot-sizing and scheduling of flexible flow lines publication-title: Int. J. Prod. Res. – volume: 122 start-page: 1 year: 2020 end-page: 14 ident: b0140 article-title: Dynamic lot-sizing model under perishability, substitution, and limited storage capacity publication-title: Comput. Oper. Res. – volume: 66 start-page: 24 year: 2013 end-page: 33 ident: b0040 article-title: Application of data mining in a global optimization algorithm publication-title: Adv. Eng. Softw. – volume: 203 start-page: 351 year: 2013 end-page: 370 ident: b0045 article-title: Data mining-based dispatching system for solving the local pickup and delivery problem publication-title: Ann. Oper. Res. – volume: 185 start-page: 1351 year: 2008 end-page: 1374 ident: b0010 article-title: The multi-item capacitated lot-sizing problem with setup times and shortage costs publication-title: Eur. J. Oper. Res. – volume: 111 start-page: 263 year: 2017 end-page: 271 ident: b0160 article-title: Shop floor lot-sizing and scheduling with a two-stage stochastic programming model considering uncertain demand and workforce efficiency publication-title: Comput. Ind. Eng. – volume: 31 start-page: 365 year: 2003 end-page: 378 ident: b0150 article-title: The capacitated lot sizing problem: a review of models and algorithms publication-title: Omega – volume: 27 start-page: 431 year: 2015 end-page: 448 ident: b0055 article-title: Period decompositions for the capacitated lot sizing problem with setup times publication-title: INFORMS J. Comput. – volume: 49 start-page: 1957 year: 2011 end-page: 1975 ident: b0265 article-title: A stochastic production planning model under uncertain seasonal demand and market growth publication-title: Int. J. Prod. Res. – volume: 56 start-page: 366 year: 2010 end-page: 384 ident: b0185 article-title: Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over publication-title: Naval Res. Logist. – volume: 39 start-page: 1 year: 2017 end-page: 64 ident: b0050 article-title: Simultaneous lotsizing and scheduling problems: a classification and review of models publication-title: OR Spectrum – volume: 30 start-page: 1255 year: 1984 end-page: 1261 ident: b0030 article-title: Strong formulations for multi-item capacitated lot sizing publication-title: Manage. Sci. – reference: Wu, T., Akartunalı, K., Jans, R., Liang, Z., 2017. Progressive selection method for the coupled lot-sizing and cutting-stock problem. INFORMS J. Comput. 29(3), 523–543. – volume: 49 start-page: 6227 year: 2011 end-page: 6247 ident: b0220 article-title: Mathematical models for capacitated multi-level production planning problems with linked lot sizes publication-title: Int. J. Prod. Res. – volume: 111 start-page: 297 year: 2019 end-page: 310 ident: b0105 article-title: A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure publication-title: Comput. Oper. Res. – volume: 130 start-page: 1 year: 2021 end-page: 12 ident: b0035 article-title: Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection publication-title: Comput. Oper. Res. – volume: 27 start-page: 335 year: 2000 end-page: 351 ident: b0005 article-title: Economic lot sizing with the consideration of random machine unavailability time publication-title: Comput. Oper. Res. – volume: 109 start-page: 89 year: 2019 end-page: 101 ident: b0190 article-title: Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy publication-title: Comput. Oper. Res. – volume: 43 start-page: 2291 issue: 11 year: 2005 ident: 10.1016/j.cor.2021.105289_b0180 article-title: Conceptual framework for lot-sizing and scheduling of flexible flow lines publication-title: Int. J. Prod. Res. doi: 10.1080/00207540500066762 – volume: 55 start-page: 3058 issue: 11 year: 2017 ident: 10.1016/j.cor.2021.105289_b0250 article-title: Behaviour perception-based disruption models for the parallel machine capacitated lot-sizing and scheduling problem publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2016.1234083 – volume: 124 start-page: 1 issue: 105068 year: 2020 ident: 10.1016/j.cor.2021.105289_b0225 article-title: Dantzig-Wolfe decomposition for the facility location and production planning problem publication-title: Comput. Oper. Res. – volume: 29 start-page: 185 issue: 1 year: 2017 ident: 10.1016/j.cor.2021.105289_b0025 article-title: A machine learning-based approximation of strong branching publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2016.0723 – volume: 32 start-page: 185 issue: 2 year: 2004 ident: 10.1016/j.cor.2021.105289_b0125 article-title: Improved lower bounds for the capacitated lot sizing problem with setup times publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2003.06.001 – volume: 35 start-page: 832 issue: 6 year: 1987 ident: 10.1016/j.cor.2021.105289_b0065 article-title: Solving multi-item capacitated lot-sizing problems using variable redefinition publication-title: Oper. Res. doi: 10.1287/opre.35.6.832 – volume: 20 start-page: 173 issue: 9 year: 1995 ident: 10.1016/j.cor.2021.105289_b0175 article-title: Algorithms and reformulations for lot sizing problems publication-title: Core Discussion Papers – volume: 44 start-page: 337 issue: 3 year: 1990 ident: 10.1016/j.cor.2021.105289_b0080 article-title: The discrete lot-sizing and scheduling problem publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(90)90245-7 – volume: 277 start-page: 521 issue: 2 year: 2019 ident: 10.1016/j.cor.2021.105289_b0205 article-title: Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2019.03.001 – volume: 110 start-page: 77 year: 2019 ident: 10.1016/j.cor.2021.105289_b0135 article-title: Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2019.05.023 – volume: 30 start-page: 236 issue: 2 year: 2018 ident: 10.1016/j.cor.2021.105289_b0215 article-title: Analytics branching and selection for the capacitated multi-item lot sizing problem with non-identical machines publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2017.0777 – ident: 10.1016/j.cor.2021.105289_b0015 doi: 10.1287/ijoc.2016.0712 – volume: 38 start-page: 1816 issue: 12 year: 2011 ident: 10.1016/j.cor.2021.105289_b0120 article-title: Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.02.005 – volume: 54 start-page: 12 issue: 2 year: 2015 ident: 10.1016/j.cor.2021.105289_b0095 article-title: Multi-product valid inequalities for the discrete lot-sizing and scheduling problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2014.08.022 – volume: 5 start-page: 89 issue: 1 year: 1958 ident: 10.1016/j.cor.2021.105289_b0200 article-title: Dynamic version of the economic lot size model publication-title: Manage. Sci. doi: 10.1287/mnsc.5.1.89 – volume: 49 start-page: 6227 issue: 20 year: 2011 ident: 10.1016/j.cor.2021.105289_b0220 article-title: Mathematical models for capacitated multi-level production planning problems with linked lot sizes publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2010.535043 – volume: 26 start-page: 669 issue: 7 year: 1980 ident: 10.1016/j.cor.2021.105289_b0090 article-title: Deterministic production planning: algorithms and complexity publication-title: Manage. Sci. doi: 10.1287/mnsc.26.7.669 – volume: 31 start-page: 365 issue: 5 year: 2003 ident: 10.1016/j.cor.2021.105289_b0150 article-title: The capacitated lot sizing problem: a review of models and algorithms publication-title: Omega doi: 10.1016/S0305-0483(03)00059-8 – volume: 265 start-page: 503 issue: 2 year: 2018 ident: 10.1016/j.cor.2021.105289_b0195 article-title: Solving the flexible job shop scheduling problem with sequence-dependent setup times publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2017.08.021 – volume: 39 start-page: 1 issue: 1 year: 2017 ident: 10.1016/j.cor.2021.105289_b0050 article-title: Simultaneous lotsizing and scheduling problems: a classification and review of models publication-title: OR Spectrum doi: 10.1007/s00291-015-0429-4 – volume: 109 start-page: 89 year: 2019 ident: 10.1016/j.cor.2021.105289_b0190 article-title: Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2019.03.007 – volume: 27 start-page: 431 issue: 3 year: 2015 ident: 10.1016/j.cor.2021.105289_b0055 article-title: Period decompositions for the capacitated lot sizing problem with setup times publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.2014.0636 – ident: 10.1016/j.cor.2021.105289_b0210 doi: 10.1287/ijoc.2017.0746 – volume: 203 start-page: 351 issue: 1 year: 2013 ident: 10.1016/j.cor.2021.105289_b0045 article-title: Data mining-based dispatching system for solving the local pickup and delivery problem publication-title: Ann. Oper. Res. doi: 10.1007/s10479-012-1118-1 – volume: 55 start-page: 909 issue: 5 year: 2007 ident: 10.1016/j.cor.2021.105289_b0060 article-title: A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times publication-title: Oper. Res. doi: 10.1287/opre.1070.0404 – ident: 10.1016/j.cor.2021.105289_b0075 doi: 10.1016/j.cor.2021.105255 – volume: 50 start-page: 4631 issue: 16 year: 2012 ident: 10.1016/j.cor.2021.105289_b0260 article-title: A note on ‘A new dynamic programming formulation of (n×m) flowshop sequencing problems with due dates’ publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2011.616236 – start-page: 155 year: 1977 ident: 10.1016/j.cor.2021.105289_b0155 article-title: Plant location, set covering and economic lot sizes: an O(mn) algorithm for structured problems – volume: 122 start-page: 1 year: 2020 ident: 10.1016/j.cor.2021.105289_b0140 article-title: Dynamic lot-sizing model under perishability, substitution, and limited storage capacity publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2020.104978 – volume: 129 start-page: 15 year: 2019 ident: 10.1016/j.cor.2021.105289_b0230 article-title: Regression and extrapolation guided optimization for production-distribution with ship-buy-exchange options publication-title: Transp. Res. Part E doi: 10.1016/j.tre.2019.06.012 – volume: 51 start-page: 5011 issue: 16 year: 2013 ident: 10.1016/j.cor.2021.105289_b0245 article-title: MIP-based fix-and-optimise algorithms for the parallel machine capacitated lot-sizing and scheduling problem publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2013.790570 – volume: 185 start-page: 1351 issue: 3 year: 2008 ident: 10.1016/j.cor.2021.105289_b0010 article-title: The multi-item capacitated lot-sizing problem with setup times and shortage costs publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.01.053 – volume: 130 start-page: 1 year: 2021 ident: 10.1016/j.cor.2021.105289_b0035 article-title: Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2021.105234 – volume: 40 start-page: 317 issue: 1–3 year: 1988 ident: 10.1016/j.cor.2021.105289_b0170 article-title: Lot-size models with backlogging: strong reformulations and cutting planes publication-title: Math. Program. doi: 10.1007/BF01580738 – volume: 63 start-page: 136 year: 2015 ident: 10.1016/j.cor.2021.105289_b0070 article-title: Hybrid methods for lot sizing on parallel machines publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2015.04.015 – volume: 4 start-page: 115 issue: 2 year: 1958 ident: 10.1016/j.cor.2021.105289_b0165 article-title: Programming or economic lot sizes publication-title: Manage. Sci. doi: 10.1287/mnsc.4.2.115 – volume: 30 start-page: 1255 issue: 6 year: 2015 ident: 10.1016/j.cor.2021.105289_b0255 article-title: A novel sequential approximate optimization approach using data mining for engineering design optimization publication-title: Optim. Methods Software doi: 10.1080/10556788.2015.1043604 – volume: 34 start-page: 2359 issue: 8 year: 2007 ident: 10.1016/j.cor.2021.105289_b0085 article-title: An LP-based heuristic procedure for the generalized assignment problem with special ordered sets publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2005.09.008 – volume: 111 start-page: 263 year: 2017 ident: 10.1016/j.cor.2021.105289_b0160 article-title: Shop floor lot-sizing and scheduling with a two-stage stochastic programming model considering uncertain demand and workforce efficiency publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2017.07.014 – volume: 40 start-page: 1852 issue: 7 year: 2013 ident: 10.1016/j.cor.2021.105289_b0235 article-title: A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2013.01.021 – volume: 49 start-page: 1957 issue: 7 year: 2011 ident: 10.1016/j.cor.2021.105289_b0265 article-title: A stochastic production planning model under uncertain seasonal demand and market growth publication-title: Int. J. Prod. Res. doi: 10.1080/00207541003690074 – volume: 42 start-page: 805 issue: 4 year: 2015 ident: 10.1016/j.cor.2021.105289_b0100 article-title: Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach publication-title: Appl. Intell. doi: 10.1007/s10489-014-0626-x – volume: 63 start-page: 72 year: 2015 ident: 10.1016/j.cor.2021.105289_b0240 article-title: A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2015.04.010 – volume: 27 start-page: 335 issue: 4 year: 2000 ident: 10.1016/j.cor.2021.105289_b0005 article-title: Economic lot sizing with the consideration of random machine unavailability time publication-title: Comput. Oper. Res. doi: 10.1016/S0305-0548(99)00055-6 – volume: 66 start-page: 24 issue: 12 year: 2013 ident: 10.1016/j.cor.2021.105289_b0040 article-title: Application of data mining in a global optimization algorithm publication-title: Adv. Eng. Softw. doi: 10.1016/j.advengsoft.2012.11.019 – volume: 56 start-page: 366 issue: 4 year: 2010 ident: 10.1016/j.cor.2021.105289_b0185 article-title: Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over publication-title: Naval Res. Logist. doi: 10.1002/nav.20345 – volume: 45 start-page: 273 issue: 2 year: 1999 ident: 10.1016/j.cor.2021.105289_b0145 article-title: Lotsizing and scheduling on parallel machines with sequence-dependent setup costs publication-title: Manage. Sci. doi: 10.1287/mnsc.45.2.273 – volume: 35 start-page: 75 issue: 1 year: 2013 ident: 10.1016/j.cor.2021.105289_b0115 article-title: Dynamic capacitated lot sizing with random demand and dynamic safety stocks publication-title: OR Spectrum doi: 10.1007/s00291-012-0283-6 – volume: 66 start-page: 159 issue: 2 year: 2000 ident: 10.1016/j.cor.2021.105289_b0110 article-title: Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities publication-title: Int. J. Prod. Econ. doi: 10.1016/S0925-5273(99)00119-X – volume: 177 start-page: 1855 issue: 3 year: 2007 ident: 10.1016/j.cor.2021.105289_b0130 article-title: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.12.008 – volume: 30 start-page: 1255 issue: 10 year: 1984 ident: 10.1016/j.cor.2021.105289_b0030 article-title: Strong formulations for multi-item capacitated lot sizing publication-title: Manage. Sci. doi: 10.1287/mnsc.30.10.1255 – ident: 10.1016/j.cor.2021.105289_b0020 doi: 10.1080/00207540601094465 – volume: 111 start-page: 297 year: 2019 ident: 10.1016/j.cor.2021.105289_b0105 article-title: A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2019.07.005 |
| SSID | ssj0000721 |
| Score | 2.4318306 |
| Snippet | •A Dantzig-Wolfe formulation by machine decomposition is constructed.•A set-oriented data-driven branching and selection algorithm is proposed.•Numerical... The capacitated lot-sizing and machine scheduling problem with sequence-dependent setup time and setup carryover is a challenging problem with a wide... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 105289 |
| SubjectTerms | Algorithms Branching and selection Column generation Dantzig-Wolfe decomposition Data-driven Feature extraction Integer programming Job shops Linear programming Lot sizing Lower bounds Mathematical models Mixed integer Operations research Parallel machine scheduling Scheduling |
| Title | Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover |
| URI | https://dx.doi.org/10.1016/j.cor.2021.105289 https://www.proquest.com/docview/2545254125 |
| Volume | 132 |
| WOSCitedRecordID | wos000694869900014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 0305-0548 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FFiE48AggCgXtgV5AK_mZtY9VkwhQFHpIIbfV2rsurSI72E5VkPgv_FRmvY-kpURw4GKtdmM7yvdldjyemQ-h11kAm7qIMpLRNCNRkBeExwEAkiQ5j1SD9i508WlCp9NkPk-Pe72fthbmYkHLMrm8TJf_FWqYA7BV6ew_wO0uChMwBtDhCLDD8a-AH_KWE1ErK_Y2U7IZX2wdYtNp3tjcwkXVkubsu1sE9MTKFKd3IjOm8M0mWxOrl9vCVLtaNuaaMFT9retvKhl009e1ghFNR69qKWuTdmcaDLlAtAtaH_GyrsxWujk_VOEOx-LPq45kvNqMWAS-y5fTHDuW9alSUtJJJlfzPZX5IeBFapMsb5izRttERbXZ9W_cDHRc4hywVI1fA19pGgdasOhq4-3pRzY-mUzYbDSfHYTj5VeiVMnU2_uDcKgZcgvtBjROwfTvHr4fzT-sd3va1fa5L2nfnHc5hNfu_Cff55oX0Lk2s4fovnkmwYeaS49QT5Z9dMeWRPTRA4skNjtBH93b6GP5GP3Y4Bx2nMOAGnacw8A5vOacXnScw5ZzWHEO_845rDlnrglD7Dj3BJ2MR7Ojd8ToepA8jGlLuJd6VPVa8ySPYip4WohYhpkX5pSq7qWcFkGS5Vkq_GAgPJ9zKoqsyAZJ7mUDET5FO2VVymcIy4EEH1oIyn0RcfC1ilhwmSdRSAvpyWgPefYXZ7lpeq-0VxbMZjeeMwCJKZCYBmkPvXGnLHXHl20fjiyMzLis2hVlQMJtp-1byJkxHQ0LYpVjEMETx_Ptyy_Q3fXfah_ttPVKvkS384v2rKlfGYL-AiMMxCo |
| 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=Data-driven+branching+and+selection+for+lot-sizing+and+scheduling+problems+with+sequence-dependent+setups+and+setup+carryover&rft.jtitle=Computers+%26+operations+research&rft.au=Zhang%2C+Canrong&rft.au=Zhang%2C+Dandan&rft.au=Wu%2C+Tao&rft.date=2021-08-01&rft.pub=Pergamon+Press+Inc&rft.issn=0305-0548&rft.eissn=0305-0548&rft.volume=132&rft.spage=1&rft_id=info:doi/10.1016%2Fj.cor.2021.105289&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |