New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups
•Lot-sizing and scheduling with sequence-dependent setup cost and times is studied.•The time-flow model for the problem is proposed and compared with a standard model.•The time-flow model shows better theoretical and computational performance.•An ADP algorithm based on the time-flow model is also pr...
Uložené v:
| Vydané v: | European journal of operational research Ročník 302; číslo 1; s. 230 - 243 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.10.2022
|
| Predmet: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •Lot-sizing and scheduling with sequence-dependent setup cost and times is studied.•The time-flow model for the problem is proposed and compared with a standard model.•The time-flow model shows better theoretical and computational performance.•An ADP algorithm based on the time-flow model is also proposed.•The proposed algorithm shows computational benefits over the standard MIP solver.
In this paper, we propose new integer optimization models for the lot-sizing and scheduling problem with sequence-dependent setups, based on the general lot-sizing and scheduling problem. To incorporate setup crossover and carryover, we first propose a standard model that straightforwardly adapts a formulation technique from the literature. Then, as the main contribution, we propose a novel optimization model that incorporates the notion of time flow. We derive a family of valid inequalities with which to compare the tightness of the models’ linear programming relaxations. In addition, we provide an approximate dynamic programming algorithm that estimates the value of a state using its lower and upper bounds. Then, we conduct computational experiments to demonstrate the competitiveness of the proposed models and the solution algorithm. The test results show that the newly proposed time-flow model has considerable advantages compared with the standard model in terms of tightness and solvability. The proposed algorithm also shows computational benefits over the standard mixed integer programming solver. |
|---|---|
| AbstractList | •Lot-sizing and scheduling with sequence-dependent setup cost and times is studied.•The time-flow model for the problem is proposed and compared with a standard model.•The time-flow model shows better theoretical and computational performance.•An ADP algorithm based on the time-flow model is also proposed.•The proposed algorithm shows computational benefits over the standard MIP solver.
In this paper, we propose new integer optimization models for the lot-sizing and scheduling problem with sequence-dependent setups, based on the general lot-sizing and scheduling problem. To incorporate setup crossover and carryover, we first propose a standard model that straightforwardly adapts a formulation technique from the literature. Then, as the main contribution, we propose a novel optimization model that incorporates the notion of time flow. We derive a family of valid inequalities with which to compare the tightness of the models’ linear programming relaxations. In addition, we provide an approximate dynamic programming algorithm that estimates the value of a state using its lower and upper bounds. Then, we conduct computational experiments to demonstrate the competitiveness of the proposed models and the solution algorithm. The test results show that the newly proposed time-flow model has considerable advantages compared with the standard model in terms of tightness and solvability. The proposed algorithm also shows computational benefits over the standard mixed integer programming solver. |
| Author | Lee, Younsoo Lee, Kyungsik |
| Author_xml | – sequence: 1 givenname: Younsoo orcidid: 0000-0001-6993-8425 surname: Lee fullname: Lee, Younsoo email: fifays@snu.ac.kr – sequence: 2 givenname: Kyungsik surname: Lee fullname: Lee, Kyungsik email: optima@snu.ac.kr |
| BookMark | eNp9kDtOAzEQhi0EEkngAlS-wC5-ZB-RaFDES4qggdpy7NnE0a692A6Q3ITb4iVUFClGo_lnvim-MTq1zgJCV5TklNDyepPDxvmcEUZzynLC2Qka0bpiWVmX5BSNCK-qjDFanaNxCBtCCC1oMULfz_CJjY2wAo9dH01n9jIaZ3HnNLQBS6tTYdn33n2ZTkbAemdlZxROycrLrjN2hWW7ct7EdYcb53FcA25dzILZ_y7Tj6DWoLftMCZu2UKHP9M9DvC-Basg09CD1WBjiuK2DxforJFtgMu_PkFv93ev88ds8fLwNL9dZIqVPGYNB1YyxgpCuKw150yRoq5Vo8uyadSsVkWlpoSqZYpnMwrNcqanNXA1nUKpgE9QffirvAvBQyOUib8KopemFZSIQbHYiEGxGBQLykRSnFD2D-19UuR3x6GbA5TswocBL4IygwFtPKgotDPH8B-nnJzh |
| CitedBy_id | crossref_primary_10_1080_00207543_2025_2515514 crossref_primary_10_1080_00207543_2024_2329324 crossref_primary_10_1080_00207543_2023_2253311 crossref_primary_10_1007_s12351_024_00822_z crossref_primary_10_1371_journal_pone_0319257 |
| Cites_doi | 10.1051/ro/2019021 10.1016/j.omega.2019.02.005 10.1016/S0377-2217(01)00373-3 10.1080/00207543.2014.885662 10.1007/BF01539800 10.1080/00207540110081461 10.1007/s10898-015-0349-5 10.1007/s00291-015-0429-4 10.1016/0377-2217(91)90130-N 10.1016/S0377-2217(99)00159-9 10.1016/j.ejor.2013.03.036 10.1007/s10479-020-03764-9 10.1080/00207540601094465 10.1016/j.cor.2017.09.005 10.1057/jors.2013.131 10.1287/mnsc.5.1.89 10.1016/S0377-2217(97)89646-4 10.1287/mnsc.37.8.909 10.1057/jors.2011.159 10.1016/j.ejor.2014.05.018 10.1080/00207543.2011.649095 10.1007/s10479-012-1077-6 10.1287/mnsc.49.8.1039.16406 10.1287/mnsc.48.4.550.208 10.1016/j.compchemeng.2007.05.001 10.1016/j.ejor.2005.03.033 10.1016/j.cie.2016.12.037 10.1007/s10951-010-0197-6 10.1007/s10696-017-9279-5 10.1080/00207543.2019.1680892 10.1590/0101-7438.2015.035.03.0439 10.1007/s00291-004-0181-7 10.1016/j.cor.2011.02.005 10.1080/00207543.2010.535570 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier B.V. |
| Copyright_xml | – notice: 2021 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2021.12.032 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 243 |
| ExternalDocumentID | 10_1016_j_ejor_2021_12_032 S0377221721010882 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c263t-f3e262225003a8d332c0588cfd66ffc98c57c401cb058991efb9d48e3c44e6ce3 |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000804759900015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Tue Nov 18 21:32:56 EST 2025 Sat Nov 29 07:24:10 EST 2025 Fri Feb 23 02:40:50 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Approximate dynamic programming algorithm Lot-sizing and scheduling problem Integer optimization model Sequence-dependent setup Production |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c263t-f3e262225003a8d332c0588cfd66ffc98c57c401cb058991efb9d48e3c44e6ce3 |
| ORCID | 0000-0001-6993-8425 |
| PageCount | 14 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2021_12_032 crossref_primary_10_1016_j_ejor_2021_12_032 elsevier_sciencedirect_doi_10_1016_j_ejor_2021_12_032 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-10-01 2022-10-00 |
| PublicationDateYYYYMMDD | 2022-10-01 |
| PublicationDate_xml | – month: 10 year: 2022 text: 2022-10-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2022 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Almeder, Almada-Lobo (bib0006) 2011; 49 Wolsey (bib0038) 1997; 99 Fiorotto, Huaccha Neyra, de Araujo (bib0015) 2020; 58 Fleischmann, Meyr (bib0017) 1997; 19 Menezes, Clark, Almada-Lobo (bib0026) 2011; 14 Maes, McClain, Van Wassenhove (bib0023) 1991; 53 Alfieri, Brandimarte, D’Orazio (bib0002) 2002; 40 Büyüktahtakın, Liu (bib0009) 2016; 65 Wagner, Whitin (bib0037) 1958; 5 Krarup, Bilde (bib0021) 1977 Copil, Wörbelauer, Meyr, Tempelmeier (bib0013) 2017; 39 Guimarães, Klabjan, Almada-Lobo (bib0018) 2014; 239 Melega, de Araujo, Morabito (bib0025) 2020; 295 Pochet, Wolsey (bib0031) 2006 Koclar, Süral (bib0020) 2005; 27 James, Almada-Lobo (bib0019) 2011; 38 Meyr (bib0028) 2002; 139 Mohan, Gopalakrishnan, Marathe, Rajan (bib0030) 2012; 50 Suerie, Stadtler (bib0035) 2003; 49 Federgruen, Tzur (bib0014) 1991; 37 Lee, Lee (bib0022) 2020; 93 Camargo, Toledo, Almada-Lobo (bib0010) 2012; 63 Sung, Maravelias (bib0036) 2008; 32 Belo-Filho, Toledo, Almada-Lobo (bib0007) 2014; 65 Mahdieh, Clark, Bijari (bib0024) 2018; 30 Fiorotto, Jans, de Araujo (bib0016) 2017; 106 Clark, Mahdieh, Rangel (bib0012) 2014; 52 Alem, Curcio, Amorim, Almada-Lobo (bib0001) 2018; 90 Carvalho, Nascimento (bib0011) 2021 Meyr, Mann (bib0029) 2013; 229 Almada-Lobo, Klabjan, Antónia Carravilla, Oliveira (bib0005) 2007; 45 Alipour, Jolai, Monabbati, Zaerpour (bib0003) 2020; 54 Powell (bib0032) 2007 Suerie (bib0034) 2006; 174 Almada-Lobo, Clark, Guimarães, Figueira, Amorim (bib0004) 2015; 35 Bertsimas, Demir (bib0008) 2002; 48 Meyr (bib0027) 2000; 120 Powell (bib0033) 2016; 241 Mohan (10.1016/j.ejor.2021.12.032_bib0030) 2012; 50 Meyr (10.1016/j.ejor.2021.12.032_bib0027) 2000; 120 Copil (10.1016/j.ejor.2021.12.032_bib0013) 2017; 39 Meyr (10.1016/j.ejor.2021.12.032_bib0029) 2013; 229 Suerie (10.1016/j.ejor.2021.12.032_bib0035) 2003; 49 Alfieri (10.1016/j.ejor.2021.12.032_bib0002) 2002; 40 Pochet (10.1016/j.ejor.2021.12.032_bib0031) 2006 Clark (10.1016/j.ejor.2021.12.032_bib0012) 2014; 52 Powell (10.1016/j.ejor.2021.12.032_bib0032) 2007 Fiorotto (10.1016/j.ejor.2021.12.032_bib0015) 2020; 58 Suerie (10.1016/j.ejor.2021.12.032_bib0034) 2006; 174 Büyüktahtakın (10.1016/j.ejor.2021.12.032_bib0009) 2016; 65 Menezes (10.1016/j.ejor.2021.12.032_bib0026) 2011; 14 Alipour (10.1016/j.ejor.2021.12.032_bib0003) 2020; 54 Fiorotto (10.1016/j.ejor.2021.12.032_bib0016) 2017; 106 Lee (10.1016/j.ejor.2021.12.032_bib0022) 2020; 93 Wagner (10.1016/j.ejor.2021.12.032_bib0037) 1958; 5 Krarup (10.1016/j.ejor.2021.12.032_bib0021) 1977 Alem (10.1016/j.ejor.2021.12.032_bib0001) 2018; 90 Federgruen (10.1016/j.ejor.2021.12.032_bib0014) 1991; 37 Maes (10.1016/j.ejor.2021.12.032_bib0023) 1991; 53 Wolsey (10.1016/j.ejor.2021.12.032_bib0038) 1997; 99 Camargo (10.1016/j.ejor.2021.12.032_bib0010) 2012; 63 Almada-Lobo (10.1016/j.ejor.2021.12.032_bib0005) 2007; 45 Almeder (10.1016/j.ejor.2021.12.032_bib0006) 2011; 49 Sung (10.1016/j.ejor.2021.12.032_bib0036) 2008; 32 Bertsimas (10.1016/j.ejor.2021.12.032_bib0008) 2002; 48 Fleischmann (10.1016/j.ejor.2021.12.032_bib0017) 1997; 19 Almada-Lobo (10.1016/j.ejor.2021.12.032_bib0004) 2015; 35 Powell (10.1016/j.ejor.2021.12.032_bib0033) 2016; 241 Melega (10.1016/j.ejor.2021.12.032_bib0025) 2020; 295 Carvalho (10.1016/j.ejor.2021.12.032_bib0011) 2021 Mahdieh (10.1016/j.ejor.2021.12.032_bib0024) 2018; 30 Belo-Filho (10.1016/j.ejor.2021.12.032_bib0007) 2014; 65 Koclar (10.1016/j.ejor.2021.12.032_bib0020) 2005; 27 Meyr (10.1016/j.ejor.2021.12.032_bib0028) 2002; 139 James (10.1016/j.ejor.2021.12.032_bib0019) 2011; 38 Guimarães (10.1016/j.ejor.2021.12.032_bib0018) 2014; 239 |
| References_xml | – volume: 139 start-page: 277 year: 2002 end-page: 292 ident: bib0028 article-title: Simultaneous lotsizing and scheduling on parallel machines publication-title: European Journal of Operational Research – volume: 14 start-page: 209 year: 2011 end-page: 219 ident: bib0026 article-title: Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups publication-title: Journal of Scheduling – volume: 5 start-page: 89 year: 1958 end-page: 96 ident: bib0037 article-title: Dynamic version of the economic lot size model publication-title: Management Science – volume: 48 start-page: 550 year: 2002 end-page: 565 ident: bib0008 article-title: An approximate dynamic programming approach to multidimensional knapsack problems publication-title: Management Science – year: 2021 ident: bib0011 article-title: Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup publication-title: European Journal of Operational Research – volume: 30 start-page: 884 year: 2018 end-page: 923 ident: bib0024 article-title: A novel flexible model for lot sizing and scheduling with non-triangular, period overlapping and carryover setups in different machine configurations publication-title: Flexible Services and Manufacturing Journal – volume: 241 start-page: 319 year: 2016 end-page: 356 ident: bib0033 article-title: Perspectives of approximate dynamic programming publication-title: Annals of Operations Research – volume: 50 start-page: 5538 year: 2012 end-page: 5543 ident: bib0030 article-title: A note on modelling the capacitated lot-sizing problem with set-up carryover and set-up splitting publication-title: International Journal of Production Research – volume: 106 start-page: 338 year: 2017 end-page: 350 ident: bib0016 article-title: An analysis of formulations for the capacitated lot sizing problem with setup crossover publication-title: Computers & Industrial Engineering – volume: 54 start-page: 913 year: 2020 end-page: 931 ident: bib0003 article-title: General lot-sizing and scheduling for perishable food products publication-title: RAIRO - Operations Research – volume: 58 start-page: 6350 year: 2020 end-page: 6369 ident: bib0015 article-title: Impact analysis of setup carryover and crossover on lot sizing problems publication-title: International Journal of Production Research – volume: 174 start-page: 874 year: 2006 end-page: 886 ident: bib0034 article-title: Modeling of period overlapping setup times publication-title: European Journal of Operational Research – volume: 19 start-page: 11 year: 1997 end-page: 21 ident: bib0017 article-title: The general lotsizing and scheduling problem publication-title: OR Spectrum – volume: 65 start-page: 231 year: 2016 end-page: 259 ident: bib0009 article-title: Dynamic programming approximation algorithms for the capacitated lot-sizing problem publication-title: Journal of Global Optimization – volume: 35 start-page: 439 year: 2015 end-page: 464 ident: bib0004 article-title: Industrial insights into lot sizing and scheduling modeling publication-title: Pesquisa Operacional – volume: 53 start-page: 131 year: 1991 end-page: 148 ident: bib0023 article-title: Multilevel capacitated lotsizing complexity and LP-based heuristics publication-title: European Journal of Operational Research – volume: 90 start-page: 125 year: 2018 end-page: 141 ident: bib0001 article-title: A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches publication-title: Computers Operations Research – volume: 39 start-page: 1 year: 2017 end-page: 64 ident: bib0013 article-title: Simultaneous lotsizing and scheduling problems: A classification and review of models publication-title: OR Spectrum – volume: 239 start-page: 644 year: 2014 end-page: 662 ident: bib0018 article-title: Modeling lotsizing and scheduling problems with sequence dependent setups publication-title: European Journal of Operational Research – year: 2007 ident: bib0032 article-title: Approximate dynamic programming: Solving the curses of dimensionality – volume: 38 start-page: 1816 year: 2011 end-page: 1825 ident: bib0019 article-title: Single and parallel machine capacitated lotsizing and scheduling: New iterative mip-based neighborhood search heuristics publication-title: Computers & Operations Research – volume: 99 start-page: 154 year: 1997 end-page: 165 ident: bib0038 article-title: MIP modelling of changeovers in production planning and scheduling problems publication-title: European Journal of Operational Research – volume: 295 start-page: 695 year: 2020 end-page: 736 ident: bib0025 article-title: Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems publication-title: Annals of Operations Research – volume: 52 start-page: 2490 year: 2014 end-page: 2503 ident: bib0012 article-title: Production lot sizing and scheduling with non-triangular sequence-dependent setup times publication-title: International Journal of Production Research – volume: 63 start-page: 1613 year: 2012 end-page: 1630 ident: bib0010 article-title: Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries publication-title: Journal of the Operational Research Society – volume: 45 start-page: 4873 year: 2007 end-page: 4894 ident: bib0005 article-title: Single machine multi-product capacitated lot sizing with sequence-dependent setups publication-title: International Journal of Production Research – year: 2006 ident: bib0031 article-title: Production planning by mixed integer programming – year: 1977 ident: bib0021 article-title: Plant location, set covering and economic lot size: An publication-title: Numerische methoden bei optimierungsaufgaben band 3 – volume: 93 start-page: 102036 year: 2020 ident: bib0022 article-title: Lot-sizing and scheduling in flat-panel display manufacturing process publication-title: Omega – volume: 49 start-page: 1039 year: 2003 end-page: 1054 ident: bib0035 article-title: The capacitated lot-sizing problem with linked lot sizes publication-title: Management Science – volume: 49 start-page: 7315 year: 2011 end-page: 7335 ident: bib0006 article-title: Synchronisation of scarce resources for a parallel machine lotsizing problem publication-title: International Journal of Production Research – volume: 229 start-page: 718 year: 2013 end-page: 731 ident: bib0029 article-title: A decomposition approach for the general lotsizing and scheduling problem for parallel production lines publication-title: European Journal of Operational Research – volume: 120 start-page: 311 year: 2000 end-page: 326 ident: bib0027 article-title: Simultaneous lotsizing and scheduling by combining local search with dual reoptimization publication-title: European Journal of Operational Research – volume: 32 start-page: 244 year: 2008 end-page: 259 ident: bib0036 article-title: A mixed-integer programming formulation for the general capacitated lot-sizing problem publication-title: Computers & Chemical Engineering – volume: 40 start-page: 441 year: 2002 end-page: 458 ident: bib0002 article-title: LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm publication-title: International Journal of Production Research – volume: 37 start-page: 909 year: 1991 end-page: 925 ident: bib0014 article-title: A simple forward algorithm to solve general dynamic lot sizing models with n periods in publication-title: Management Science – volume: 65 start-page: 1735 year: 2014 end-page: 1747 ident: bib0007 article-title: Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover publication-title: Journal of the Operational Research Society – volume: 27 start-page: 145 year: 2005 end-page: 146 ident: bib0020 article-title: A note on “the general lot sizing and scheduling problem” publication-title: OR Spectrum – year: 1977 ident: 10.1016/j.ejor.2021.12.032_bib0021 article-title: Plant location, set covering and economic lot size: An o(mn)-algorithm for structured problems – volume: 54 start-page: 913 year: 2020 ident: 10.1016/j.ejor.2021.12.032_bib0003 article-title: General lot-sizing and scheduling for perishable food products publication-title: RAIRO - Operations Research doi: 10.1051/ro/2019021 – volume: 93 start-page: 102036 year: 2020 ident: 10.1016/j.ejor.2021.12.032_bib0022 article-title: Lot-sizing and scheduling in flat-panel display manufacturing process publication-title: Omega doi: 10.1016/j.omega.2019.02.005 – volume: 139 start-page: 277 year: 2002 ident: 10.1016/j.ejor.2021.12.032_bib0028 article-title: Simultaneous lotsizing and scheduling on parallel machines publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00373-3 – volume: 52 start-page: 2490 year: 2014 ident: 10.1016/j.ejor.2021.12.032_bib0012 article-title: Production lot sizing and scheduling with non-triangular sequence-dependent setup times publication-title: International Journal of Production Research doi: 10.1080/00207543.2014.885662 – volume: 19 start-page: 11 year: 1997 ident: 10.1016/j.ejor.2021.12.032_bib0017 article-title: The general lotsizing and scheduling problem publication-title: OR Spectrum doi: 10.1007/BF01539800 – volume: 40 start-page: 441 year: 2002 ident: 10.1016/j.ejor.2021.12.032_bib0002 article-title: LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm publication-title: International Journal of Production Research doi: 10.1080/00207540110081461 – volume: 65 start-page: 231 year: 2016 ident: 10.1016/j.ejor.2021.12.032_bib0009 article-title: Dynamic programming approximation algorithms for the capacitated lot-sizing problem publication-title: Journal of Global Optimization doi: 10.1007/s10898-015-0349-5 – volume: 39 start-page: 1 year: 2017 ident: 10.1016/j.ejor.2021.12.032_bib0013 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: 53 start-page: 131 year: 1991 ident: 10.1016/j.ejor.2021.12.032_bib0023 article-title: Multilevel capacitated lotsizing complexity and LP-based heuristics publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(91)90130-N – volume: 120 start-page: 311 year: 2000 ident: 10.1016/j.ejor.2021.12.032_bib0027 article-title: Simultaneous lotsizing and scheduling by combining local search with dual reoptimization publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00159-9 – volume: 229 start-page: 718 year: 2013 ident: 10.1016/j.ejor.2021.12.032_bib0029 article-title: A decomposition approach for the general lotsizing and scheduling problem for parallel production lines publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.03.036 – volume: 295 start-page: 695 year: 2020 ident: 10.1016/j.ejor.2021.12.032_bib0025 article-title: Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems publication-title: Annals of Operations Research doi: 10.1007/s10479-020-03764-9 – volume: 45 start-page: 4873 year: 2007 ident: 10.1016/j.ejor.2021.12.032_bib0005 article-title: Single machine multi-product capacitated lot sizing with sequence-dependent setups publication-title: International Journal of Production Research doi: 10.1080/00207540601094465 – volume: 90 start-page: 125 year: 2018 ident: 10.1016/j.ejor.2021.12.032_bib0001 article-title: A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches publication-title: Computers Operations Research doi: 10.1016/j.cor.2017.09.005 – volume: 65 start-page: 1735 year: 2014 ident: 10.1016/j.ejor.2021.12.032_bib0007 article-title: Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover publication-title: Journal of the Operational Research Society doi: 10.1057/jors.2013.131 – volume: 5 start-page: 89 year: 1958 ident: 10.1016/j.ejor.2021.12.032_bib0037 article-title: Dynamic version of the economic lot size model publication-title: Management Science doi: 10.1287/mnsc.5.1.89 – volume: 99 start-page: 154 year: 1997 ident: 10.1016/j.ejor.2021.12.032_bib0038 article-title: MIP modelling of changeovers in production planning and scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(97)89646-4 – volume: 37 start-page: 909 year: 1991 ident: 10.1016/j.ejor.2021.12.032_bib0014 article-title: A simple forward algorithm to solve general dynamic lot sizing models with n periods in o(nlogn) or o(n) time publication-title: Management Science doi: 10.1287/mnsc.37.8.909 – volume: 63 start-page: 1613 year: 2012 ident: 10.1016/j.ejor.2021.12.032_bib0010 article-title: Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries publication-title: Journal of the Operational Research Society doi: 10.1057/jors.2011.159 – volume: 239 start-page: 644 year: 2014 ident: 10.1016/j.ejor.2021.12.032_bib0018 article-title: Modeling lotsizing and scheduling problems with sequence dependent setups publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.05.018 – volume: 50 start-page: 5538 year: 2012 ident: 10.1016/j.ejor.2021.12.032_bib0030 article-title: A note on modelling the capacitated lot-sizing problem with set-up carryover and set-up splitting publication-title: International Journal of Production Research doi: 10.1080/00207543.2011.649095 – volume: 241 start-page: 319 year: 2016 ident: 10.1016/j.ejor.2021.12.032_bib0033 article-title: Perspectives of approximate dynamic programming publication-title: Annals of Operations Research doi: 10.1007/s10479-012-1077-6 – volume: 49 start-page: 1039 year: 2003 ident: 10.1016/j.ejor.2021.12.032_bib0035 article-title: The capacitated lot-sizing problem with linked lot sizes publication-title: Management Science doi: 10.1287/mnsc.49.8.1039.16406 – year: 2021 ident: 10.1016/j.ejor.2021.12.032_bib0011 article-title: Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup publication-title: European Journal of Operational Research – volume: 48 start-page: 550 year: 2002 ident: 10.1016/j.ejor.2021.12.032_bib0008 article-title: An approximate dynamic programming approach to multidimensional knapsack problems publication-title: Management Science doi: 10.1287/mnsc.48.4.550.208 – volume: 32 start-page: 244 year: 2008 ident: 10.1016/j.ejor.2021.12.032_bib0036 article-title: A mixed-integer programming formulation for the general capacitated lot-sizing problem publication-title: Computers & Chemical Engineering doi: 10.1016/j.compchemeng.2007.05.001 – volume: 174 start-page: 874 year: 2006 ident: 10.1016/j.ejor.2021.12.032_bib0034 article-title: Modeling of period overlapping setup times publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.03.033 – volume: 106 start-page: 338 year: 2017 ident: 10.1016/j.ejor.2021.12.032_bib0016 article-title: An analysis of formulations for the capacitated lot sizing problem with setup crossover publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2016.12.037 – volume: 14 start-page: 209 year: 2011 ident: 10.1016/j.ejor.2021.12.032_bib0026 article-title: Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups publication-title: Journal of Scheduling doi: 10.1007/s10951-010-0197-6 – volume: 30 start-page: 884 year: 2018 ident: 10.1016/j.ejor.2021.12.032_bib0024 article-title: A novel flexible model for lot sizing and scheduling with non-triangular, period overlapping and carryover setups in different machine configurations publication-title: Flexible Services and Manufacturing Journal doi: 10.1007/s10696-017-9279-5 – volume: 58 start-page: 6350 year: 2020 ident: 10.1016/j.ejor.2021.12.032_bib0015 article-title: Impact analysis of setup carryover and crossover on lot sizing problems publication-title: International Journal of Production Research doi: 10.1080/00207543.2019.1680892 – volume: 35 start-page: 439 year: 2015 ident: 10.1016/j.ejor.2021.12.032_bib0004 article-title: Industrial insights into lot sizing and scheduling modeling publication-title: Pesquisa Operacional doi: 10.1590/0101-7438.2015.035.03.0439 – year: 2007 ident: 10.1016/j.ejor.2021.12.032_bib0032 – volume: 27 start-page: 145 year: 2005 ident: 10.1016/j.ejor.2021.12.032_bib0020 article-title: A note on “the general lot sizing and scheduling problem” publication-title: OR Spectrum doi: 10.1007/s00291-004-0181-7 – volume: 38 start-page: 1816 year: 2011 ident: 10.1016/j.ejor.2021.12.032_bib0019 article-title: Single and parallel machine capacitated lotsizing and scheduling: New iterative mip-based neighborhood search heuristics publication-title: Computers & Operations Research doi: 10.1016/j.cor.2011.02.005 – volume: 49 start-page: 7315 year: 2011 ident: 10.1016/j.ejor.2021.12.032_bib0006 article-title: Synchronisation of scarce resources for a parallel machine lotsizing problem publication-title: International Journal of Production Research doi: 10.1080/00207543.2010.535570 – year: 2006 ident: 10.1016/j.ejor.2021.12.032_bib0031 |
| SSID | ssj0001515 |
| Score | 2.4338617 |
| Snippet | •Lot-sizing and scheduling with sequence-dependent setup cost and times is studied.•The time-flow model for the problem is proposed and compared with a... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 230 |
| SubjectTerms | Approximate dynamic programming algorithm Integer optimization model Lot-sizing and scheduling problem Production Sequence-dependent setup |
| Title | New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups |
| URI | https://dx.doi.org/10.1016/j.ejor.2021.12.032 |
| Volume | 302 |
| WOSCitedRecordID | wos000804759900015&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: ScienceDirect database customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FFiE48Aggykt74BYZ2Wt7vT5WqIiXKg5Fys1y1mtwmtiR7VZp_wk_gv_IrHfWMQmt6IFDrGgVjxPNl5nZ2flmCHkTCuXKIIgcLjh3IP73HMBN6og0U7M8YzxNO6Lwl-j4WEyn8dfR6JflwpwvorIU63W8-q-qhjVQtqbO3kDdvVBYgPegdLiC2uH6T4rXFYtdEwhVTyowCEtkWpqhNw12ZzXNxNcFBKxqkpmx9LZYa9kRFxffq7pofyz7QsRF1TpNcWlZjbAtBjeFbPZuKg3Wu2NxtmPn67aw1J6tmisPATAghoXapiaxB1Gfq8Z6IW2bmqraWv18ARarKU6HGQzY_NpauJ65FUUOY4bDaa2y77Id-KGNxYMc466Z6fK04wlMUmL-Vs0r3faVeV3WF3Opf7Td3nKHfZGirX-bJ1pGomUkHktAxi2yz6IwBiO6f_jxaPqpd_06OuyOrfAHIUvLFBRuf5O_R0KD6ObkIbmP2xJ6aOD0iIxUOSZ3LCtiTB7Y6R8UncGY3Bu0snxMfgLsKMKODmFHDewoQAZedAA7irCjA9jRHnYUYEcBdnQDu07GBnYUYUc17Ogu7KiB3RPy7f3RybsPDo79cCTjfuvkvmJcpyHA4aQi830m3VAImWec57mMhQwjGbienOmRmLGn8lmcBUL5YHMUl8p_SvbKqlTPCE2Fnv-qoliPYgrzmdD8wIC7mVCxgs37AfGsChKJPfH1aJZFcrXyD8ikv2dlOsJc--nQajbBmNbEqgkA9Zr7nt_oKS_I3c0f6yXZa-sz9Yrcludt0dSvEaW_AR3AzLI |
| 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=New+integer+optimization+models+and+an+approximate+dynamic+programming+algorithm+for+the+lot-sizing+and+scheduling+problem+with+sequence-dependent+setups&rft.jtitle=European+journal+of+operational+research&rft.au=Lee%2C+Younsoo&rft.au=Lee%2C+Kyungsik&rft.date=2022-10-01&rft.issn=0377-2217&rft.volume=302&rft.issue=1&rft.spage=230&rft.epage=243&rft_id=info:doi/10.1016%2Fj.ejor.2021.12.032&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2021_12_032 |
| 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 |