An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
•We study a lot-sizing problem with sequence-dependent changeover costs and times.•This problem is formulated as a quadratically constrained quadratic binary program.•We compute lower bounds using a semidefinite rather than a linear relaxation.•Comparison with the best known linear relaxations shows...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 237; číslo 2; s. 498 - 507 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Amsterdam
Elsevier B.V
01.09.2014
Elsevier Sequoia S.A Elsevier |
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | •We study a lot-sizing problem with sequence-dependent changeover costs and times.•This problem is formulated as a quadratically constrained quadratic binary program.•We compute lower bounds using a semidefinite rather than a linear relaxation.•Comparison with the best known linear relaxations shows a significant improvement.•The SDP relaxation provides the optimal integer value for 83% of the small-size instances.
The present work is intended as a first step towards applying semidefinite programming models and tools to discrete lot-sizing problems including sequence-dependent changeover costs and times. Such problems can be formulated as quadratically constrained quadratic binary programs. We investigate several semidefinite relaxations by combining known reformulation techniques recently proposed for generic quadratic binary problems with problem-specific strengthening procedures developed for lot-sizing problems. Our computational results show that the semidefinite relaxations consistently provide lower bounds of significantly improved quality as compared with those provided by the best previously published linear relaxations. In particular, the gap between the semidefinite relaxation and the optimal integer solution value can be closed for a significant proportion of the small-size instances, thus avoiding to resort to a tree search procedure. The reported computation times are significant. However improvements in SDP technology can still be expected in the future, making SDP based approaches to discrete lot-sizing more competitive. |
|---|---|
| AbstractList | The present work is intended as a first step towards applying semidefinite programming models and tools to discrete lot-sizing problems including sequence-dependent changeover costs and times. Such problems can be formulated as quadratically constrained quadratic binary programs. We investigate several semidefinite relaxations by combining known reformulation techniques recently proposed for generic quadratic binary problems with problem-specific strengthening procedures developed for lot-sizing problems. Our computational results show that the semidefinite relaxations consistently provide lower bounds of significantly improved quality as compared with those provided by the best previously published linear relaxations. In particular, the gap between the semidefinite relaxation and the optimal integer solution value can be closed for a significant proportion of the small-size instances, thus avoiding to resort to a tree search procedure. The reported computation times are significant. However improvements in SDP technology can still be expected in the future, making SDP based approaches to discrete lot-sizing more competitive. •We study a lot-sizing problem with sequence-dependent changeover costs and times.•This problem is formulated as a quadratically constrained quadratic binary program.•We compute lower bounds using a semidefinite rather than a linear relaxation.•Comparison with the best known linear relaxations shows a significant improvement.•The SDP relaxation provides the optimal integer value for 83% of the small-size instances. The present work is intended as a first step towards applying semidefinite programming models and tools to discrete lot-sizing problems including sequence-dependent changeover costs and times. Such problems can be formulated as quadratically constrained quadratic binary programs. We investigate several semidefinite relaxations by combining known reformulation techniques recently proposed for generic quadratic binary problems with problem-specific strengthening procedures developed for lot-sizing problems. Our computational results show that the semidefinite relaxations consistently provide lower bounds of significantly improved quality as compared with those provided by the best previously published linear relaxations. In particular, the gap between the semidefinite relaxation and the optimal integer solution value can be closed for a significant proportion of the small-size instances, thus avoiding to resort to a tree search procedure. The reported computation times are significant. However improvements in SDP technology can still be expected in the future, making SDP based approaches to discrete lot-sizing more competitive. The present work is intended as a first step towards applying semidefinite programming models and tools to discrete lot-sizing problems including sequence-dependent changeover costs and times. Such problems can be formulated as quadratically constrained quadratic binary programs. We investigate several semidefinite relaxations by combining known reformulation techniques recently proposed for generic quadratic binary problems with problem-specific strengthening procedures developed for lot-sizing problems. Our computational results show that the semidefinite relaxations consistently provide lower bounds of significantly improved quality as compared with those provided by the best previously published linear relaxations. In particular, the gap between the semidefinite relaxation and the optimal integer solution value can be closed for a significant proportion of the small-size instances, thus avoiding to resort to a tree search procedure. The reported computation times are significant. However improvements in SDP technology can still be expected in the future, making SDP based approaches to discrete lot-sizing more competitive. [PUBLICATION ABSTRACT] The present work is intended as a first step towards applying semidefinite programming models and tools to discrete lot-sizing problems including sequence-dependent changeover costs and times. Such problems can be formulated as quadratically constrained quadratic binary programs. We investigate several semidefinite relaxations by combining known reformulation techniques recently proposed for generic quadratic binary problems with problem-specific strengthening procedures developped for lot-sizing problems. Our computational results show that the semidefinite relaxations consistently provide lower bounds of significantly improved quality as compared with those provided by the best previously published linear relaxations. In particular, the gap between the semidefinite relaxation and the optimal integer solution value can be closed for a significant proportion of the small-size instances, thus avoiding to resort to a tree search procedure. The reported computation times are significant. However improvements in SDP technology can still be expected in the future, making SDP based approaches to discrete lot-sizing more competitive. |
| Author | Lisser, A. Minoux, M. Gicquel, C. |
| Author_xml | – sequence: 1 givenname: C. surname: Gicquel fullname: Gicquel, C. email: celine.gicquel@lri.fr organization: Laboratoire de Recherche en Informatique, Université Paris Sud, Campus d’Orsay, bâtiment 650, 91405 Orsay Cedex, France – sequence: 2 givenname: A. surname: Lisser fullname: Lisser, A. organization: Laboratoire de Recherche en Informatique, Université Paris Sud, Campus d’Orsay, bâtiment 650, 91405 Orsay Cedex, France – sequence: 3 givenname: M. surname: Minoux fullname: Minoux, M. organization: Laboratoire d’Informatique de Paris 6, Université Pierre et Marie Curie, 4 place Jussieu, 75005 Paris, France |
| BackLink | https://hal.science/hal-01120234$$DView record in HAL |
| BookMark | eNp9kcFq3DAQhkVIIZu0L9CToZf24O2MbFky9LKEtiks9NKcchCyPEpkbGsreRfap6_cLT3kEBgQDN83zOi_ZpdzmImxtwhbBGw-DlsaQtxywHoLPJe8YBtUkpeNauCSbaCSsuQc5RW7TmkAABQoNuxhNxd0MuPRLD7MRXBFosn35PzsFyoOMTxGM01-fiw6k6gvzCH3jH2iVLgQi94nGymTY1jK5H-vYAa6kab0mr1yZkz05t97w-6_fP5xe1fuv3_9drvbl7aWsJSmlhI7bqjCBqVyoudtBy23qEQN3AFUNRmyTinRKYe8rVTDyZIR3LWdqW7Yh_PcJzPqQ_STib90MF7f7fZ67QEiB17VJ8zs-zObl_x5pLToKV9A42hmCsekUYi2EYgSMvruGTqEY5zzJZniUHMU9TqQnykbQ0qR3P8NEPSajR70mo1es9HAc8ksqWeS9cvfBJZo_Piy-umsUv7Rk6eok_U0W-p9JLvoPviX9D8MzKul |
| CODEN | EJORDT |
| CitedBy_id | crossref_primary_10_1007_s00291_015_0429_4 crossref_primary_10_1016_j_ifacol_2022_09_522 crossref_primary_10_1007_s11740_016_0700_9 crossref_primary_10_1016_j_cie_2024_109937 |
| Cites_doi | 10.1145/227683.227684 10.1016/j.ejor.2005.12.008 10.1016/j.disopt.2005.03.001 10.1137/0403036 10.1016/j.epsr.2012.04.001 10.1016/S0167-6377(96)00043-0 10.1145/375827.375840 10.1016/0377-2217(90)90245-7 10.1016/S0377-2217(96)00020-3 10.1137/S1052623497328008 10.1016/j.disopt.2009.01.002 10.1007/BF01100205 10.1080/00207540600902262 10.1016/j.ijpe.2011.11.028 10.1016/j.cie.2006.01.001 10.1007/s10878-004-4838-6 10.1016/j.cor.2004.04.012 10.1023/A:1009898604624 10.1016/j.orl.2008.10.001 10.1137/0801013 10.1007/s00291-008-0150-7 10.1137/S1052623497328987 10.1016/S0377-2217(01)00143-6 10.1080/00207543.2010.532927 10.1287/mnsc.5.1.89 10.1007/978-1-4614-0769-0_24 10.1287/opre.35.6.832 10.1287/mnsc.47.7.993.9800 10.1023/A:1009795911987 |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier B.V. Copyright Elsevier Sequoia S.A. Sep 1, 2014 Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2014 Elsevier B.V. – notice: Copyright Elsevier Sequoia S.A. Sep 1, 2014 – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D 7TA JG9 1XC VOOES |
| DOI | 10.1016/j.ejor.2014.02.027 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Materials Business File Materials Research Database Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Materials Research Database Materials Business File |
| DatabaseTitleList | Materials Research Database Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 507 |
| ExternalDocumentID | oai:HAL:hal-01120234v1 3291710241 10_1016_j_ejor_2014_02_027 S037722171400160X |
| Genre | Feature |
| 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 AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB 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 AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD 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 RIG 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 AALRI AAQXK AATTM AAXKI AAYWO AAYXX ABWVN 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 FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D 7TA JG9 1XC VOOES |
| ID | FETCH-LOGICAL-c470t-a4771b2ae316178f5d29b092c185402f0034eaecf885b8f1293862ecea52f9ba3 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000336110000011&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 Oct 14 20:46:40 EDT 2025 Sun Sep 28 04:47:00 EDT 2025 Sun Nov 30 03:43:39 EST 2025 Sat Nov 29 01:41:10 EST 2025 Tue Nov 18 21:32:55 EST 2025 Fri Feb 23 02:32:26 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Quadratically constrained quadratic binary programming Discrete lot-sizing and scheduling problem Semidefinite relaxation Manufacturing Cutting planes Sequence-dependent changeover costs and times semidefinite relaxation manufacturing quadratically constrained quadratic binary programming cutting planes discrete lot-sizing and scheduling problem sequence-dependent changeover costs and times |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c470t-a4771b2ae316178f5d29b092c185402f0034eaecf885b8f1293862ecea52f9ba3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ORCID | 0000-0003-1318-6679 0000-0002-2719-7443 |
| OpenAccessLink | https://hal.science/hal-01120234 |
| PQID | 1520421541 |
| PQPubID | 45678 |
| PageCount | 10 |
| ParticipantIDs | hal_primary_oai_HAL_hal_01120234v1 proquest_miscellaneous_1559651170 proquest_journals_1520421541 crossref_primary_10_1016_j_ejor_2014_02_027 crossref_citationtrail_10_1016_j_ejor_2014_02_027 elsevier_sciencedirect_doi_10_1016_j_ejor_2014_02_027 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-09-01 |
| PublicationDateYYYYMMDD | 2014-09-01 |
| PublicationDate_xml | – month: 09 year: 2014 text: 2014-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2014 |
| Publisher | Elsevier B.V Elsevier Sequoia S.A Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier Sequoia S.A – name: Elsevier |
| References | Zhao, Kharisch, Rendl, Wolkovicz (b0170) 1998; 2 Jans, Degraeve (b0090) 2008; 46 Pochet, Wolsey (b0110) 2006 Helmberg, Rendl (b0075) 2000; 10 Salomon, Solomon, van Wassenhove, Dumas, Dauzère-Pérès (b0135) 1997; 100 Gicquel, Minoux, Dallery (b0055) 2011; 49 Anjos, Kennings, Vannelli (b0005) 2005; 2 RR-3710. INRIA Rhones-Alpes, ZIRST-655 avenue de l’Europe, F-38330 Montbonnot Saint-Martin, June 1999. Poljak, Rendl, Wolkowicz (b0115) 1995; 7 van Eijl, van Hoesel (b0155) 1997; 20 Fleischmann (b0045) 1990; 44 Povh, Rendl (b0120) 2009; 6 Goemans, Williamson (b0060) 1995; 42 Engau (b0030) 2012 Ferreira, Clark, Almada-Lobo, Morabito (b0040) 2012; 136 Skutella (b0150) 2001; 48 Mhanna, Jabr (b0105) 2012; 90 Silva, Magalhaes (b0145) 2006; 50 Dastidar, Nagi (b0025) 2005; 32 Helmberg, C. (2000). Semidefinite programming for combinatorial optimization. Wagner, Whitin (b0160) 1958; 5 Helmberg (b0070) 2002; 137 Rendl (b0125) 2012; 10 Jans, Degraeve (b0085) 2007; 177 Lemarechal, C., Oustry, F. (1999). Helmberg, Rendl, Weismantel (b0080) 2000; 4 Lovàsz, Schrijver (b0100) 1991; 1 . Yamashita, Fujisawa, Fukuda, Kobayashi, Nakata, Nakata (b0165) 2012 Benson, Ye, Zhang (b0015) 2000; 10 Belvaux, Wolsey (b0010) 2001; 47 Gicquel, Minoux, Dallery (b0050) 2009; 37 Sherali, Adams (b0140) 1990; 3 Eppen, Martin (b0035) 1987; 35 Buschkühl, Sahling, Helber, Tempelmeier (b0020) 2010; 32 Roupin (b0130) 2004; 8 Ferreira (10.1016/j.ejor.2014.02.027_b0040) 2012; 136 Jans (10.1016/j.ejor.2014.02.027_b0085) 2007; 177 Salomon (10.1016/j.ejor.2014.02.027_b0135) 1997; 100 Benson (10.1016/j.ejor.2014.02.027_b0015) 2000; 10 Skutella (10.1016/j.ejor.2014.02.027_b0150) 2001; 48 Zhao (10.1016/j.ejor.2014.02.027_b0170) 1998; 2 Povh (10.1016/j.ejor.2014.02.027_b0120) 2009; 6 Engau (10.1016/j.ejor.2014.02.027_b0030) 2012 Buschkühl (10.1016/j.ejor.2014.02.027_b0020) 2010; 32 Anjos (10.1016/j.ejor.2014.02.027_b0005) 2005; 2 Wagner (10.1016/j.ejor.2014.02.027_b0160) 1958; 5 Rendl (10.1016/j.ejor.2014.02.027_b0125) 2012; 10 10.1016/j.ejor.2014.02.027_b0095 Helmberg (10.1016/j.ejor.2014.02.027_b0075) 2000; 10 Lovàsz (10.1016/j.ejor.2014.02.027_b0100) 1991; 1 10.1016/j.ejor.2014.02.027_b0065 Gicquel (10.1016/j.ejor.2014.02.027_b0050) 2009; 37 Gicquel (10.1016/j.ejor.2014.02.027_b0055) 2011; 49 Jans (10.1016/j.ejor.2014.02.027_b0090) 2008; 46 Poljak (10.1016/j.ejor.2014.02.027_b0115) 1995; 7 Yamashita (10.1016/j.ejor.2014.02.027_b0165) 2012 Sherali (10.1016/j.ejor.2014.02.027_b0140) 1990; 3 Goemans (10.1016/j.ejor.2014.02.027_b0060) 1995; 42 Dastidar (10.1016/j.ejor.2014.02.027_b0025) 2005; 32 Pochet (10.1016/j.ejor.2014.02.027_b0110) 2006 Roupin (10.1016/j.ejor.2014.02.027_b0130) 2004; 8 Fleischmann (10.1016/j.ejor.2014.02.027_b0045) 1990; 44 Helmberg (10.1016/j.ejor.2014.02.027_b0070) 2002; 137 Silva (10.1016/j.ejor.2014.02.027_b0145) 2006; 50 van Eijl (10.1016/j.ejor.2014.02.027_b0155) 1997; 20 Belvaux (10.1016/j.ejor.2014.02.027_b0010) 2001; 47 Eppen (10.1016/j.ejor.2014.02.027_b0035) 1987; 35 Helmberg (10.1016/j.ejor.2014.02.027_b0080) 2000; 4 Mhanna (10.1016/j.ejor.2014.02.027_b0105) 2012; 90 |
| References_xml | – volume: 47 start-page: 993 year: 2001 end-page: 1007 ident: b0010 article-title: Modelling practical lot-sizing problems as mixed-integer programs publication-title: Management Science – reference: Lemarechal, C., Oustry, F. (1999). – volume: 10 start-page: 321 year: 2012 end-page: 346 ident: b0125 article-title: Semidefinite relaxations for partitioning, assignment and ordering problems publication-title: 40R-Quaterly Journal of Operations Research – volume: 20 start-page: 7 year: 1997 end-page: 13 ident: b0155 article-title: On the discrete lot-sizing and scheduling problem with Wagner–Whitin costs publication-title: Operations Research Letters – start-page: 687 year: 2012 end-page: 714 ident: b0165 article-title: Latest developments in the SDPA family for solving large-scale SDPs publication-title: Handbook on semidefinite, conic and polynomial optimization. International series in operations research and management science – volume: 8 start-page: 469 year: 2004 end-page: 493 ident: b0130 article-title: From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems publication-title: Journal of Combinatorial Optimization – reference: Helmberg, C. (2000). Semidefinite programming for combinatorial optimization. – volume: 136 start-page: 255 year: 2012 end-page: 265 ident: b0040 article-title: Single-stage formulations for synchronized two-stage lot-sizing and scheduling in soft drink production publication-title: International Journal of Production Economics – volume: 32 start-page: 231 year: 2010 end-page: 261 ident: b0020 article-title: Dynamic capacitated lot-sizing problems: Classification and review of solution approaches publication-title: OR Spectrum – volume: 37 start-page: 32 year: 2009 end-page: 36 ident: b0050 article-title: On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times publication-title: Operations Research Letters – volume: 42 start-page: 1115 year: 1995 end-page: 1145 ident: b0060 article-title: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming publication-title: Journal of the ACM – volume: 44 start-page: 337 year: 1990 end-page: 348 ident: b0045 article-title: The discrete lot sizing and scheduling problem publication-title: European Journal of Operational Research – volume: 100 start-page: 494 year: 1997 end-page: 513 ident: b0135 article-title: Solving the discrete lotsizing and scheduling problem with sequence dependant set-up costs and set-up times using the travelling salesman problem with time windows publication-title: European Journal of Operational Research – year: 2006 ident: b0110 article-title: Production planning by mixed integer programming – volume: 177 start-page: 1855 year: 2007 end-page: 1875 ident: b0085 article-title: Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches publication-title: European Journal of Operational Research – volume: 90 start-page: 85 year: 2012 end-page: 92 ident: b0105 article-title: Application of semidefinite programming relaxation and selective pruning to the unit commitment problem publication-title: Electric Power System Research – volume: 137 start-page: 461 year: 2002 end-page: 482 ident: b0070 article-title: Semidefinite programming publication-title: European Journal of Operational Research – volume: 10 start-page: 673 year: 2000 end-page: 696 ident: b0075 article-title: A spectral bundle method for semidefinite programming publication-title: SIAM Journal of Optimization – volume: 46 start-page: 1619 year: 2008 end-page: 1643 ident: b0090 article-title: Modelling industrial lot sizing problems: A review publication-title: Industrial Journal of Production Research – volume: 49 start-page: 2587 year: 2011 end-page: 2603 ident: b0055 article-title: Exact solution approaches for the discrete lot-sizing and scheduling problem with identical parallel resources publication-title: International Journal of Production Research – volume: 3 start-page: 411 year: 1990 end-page: 430 ident: b0140 article-title: A hierarchy of relaxations between continuous and convex hull representations for zero-one programming problems publication-title: SIAM Journal on Discrete Mathematics – volume: 10 start-page: 443 year: 2000 end-page: 461 ident: b0015 article-title: Solving large-scale sparse semidefinite programs for combinatorial optimization publication-title: SIAM Journal on Optimization – volume: 4 start-page: 197 year: 2000 end-page: 215 ident: b0080 article-title: A semidefinite programming approach to the quadratic knapsack problem publication-title: Journal of Combinatorial Optimization – volume: 35 start-page: 832 year: 1987 end-page: 848 ident: b0035 article-title: Solving multi-item capacitated lot-sizing problems using variable redefinition publication-title: Operations Research – volume: 2 start-page: 71 year: 1998 end-page: 109 ident: b0170 article-title: Semidefinite programming relaxations for the quadratic assignment problem publication-title: Journal of Combinatorial Optimization – volume: 6 start-page: 231 year: 2009 end-page: 241 ident: b0120 article-title: Copositive and semidefinite relaxations of the quadratic assignment problem publication-title: Discrete Optimisation – reference: . – volume: 48 start-page: 206 year: 2001 end-page: 242 ident: b0150 article-title: Convex quadratic and semidefinite programming relaxations in scheduling publication-title: Journal of the ACM – reference: . RR-3710. INRIA Rhones-Alpes, ZIRST-655 avenue de l’Europe, F-38330 Montbonnot Saint-Martin, June 1999. – volume: 2 start-page: 113 year: 2005 end-page: 122 ident: b0005 article-title: A semidefinite optimization approach of the single-row layout problem with unequal dimensions publication-title: Discrete Optimization – volume: 32 start-page: 2987 year: 2005 end-page: 3005 ident: b0025 article-title: Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs publication-title: Computers & Operations Research – volume: 1 start-page: 166 year: 1991 end-page: 190 ident: b0100 article-title: Cones of matrices and set-functions and 0–1 optimization publication-title: SIAM Journal on Optimization – volume: 7 start-page: 51 year: 1995 end-page: 73 ident: b0115 article-title: A recipe for semidefinite relaxation of (0–1) quadratic programming publication-title: Journal of Global Optimization – volume: 50 start-page: 79 year: 2006 end-page: 89 ident: b0145 article-title: Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry publication-title: Computers & Industrial Engineering – volume: 5 start-page: 89 year: 1958 end-page: 96 ident: b0160 article-title: Dynamic version of the economic lot size model publication-title: Management Science – start-page: 471 year: 2012 end-page: 488 ident: b0030 article-title: Recent progress in interior-point methods: Cutting-plane methods and warm starts publication-title: Handbook of semidefinite, conic and polynomial optimiztion – volume: 42 start-page: 1115 issue: 6 year: 1995 ident: 10.1016/j.ejor.2014.02.027_b0060 article-title: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming publication-title: Journal of the ACM doi: 10.1145/227683.227684 – volume: 177 start-page: 1855 year: 2007 ident: 10.1016/j.ejor.2014.02.027_b0085 article-title: Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.12.008 – volume: 2 start-page: 113 year: 2005 ident: 10.1016/j.ejor.2014.02.027_b0005 article-title: A semidefinite optimization approach of the single-row layout problem with unequal dimensions publication-title: Discrete Optimization doi: 10.1016/j.disopt.2005.03.001 – ident: 10.1016/j.ejor.2014.02.027_b0095 – volume: 3 start-page: 411 issue: 3 year: 1990 ident: 10.1016/j.ejor.2014.02.027_b0140 article-title: A hierarchy of relaxations between continuous and convex hull representations for zero-one programming problems publication-title: SIAM Journal on Discrete Mathematics doi: 10.1137/0403036 – volume: 90 start-page: 85 year: 2012 ident: 10.1016/j.ejor.2014.02.027_b0105 article-title: Application of semidefinite programming relaxation and selective pruning to the unit commitment problem publication-title: Electric Power System Research doi: 10.1016/j.epsr.2012.04.001 – start-page: 471 year: 2012 ident: 10.1016/j.ejor.2014.02.027_b0030 article-title: Recent progress in interior-point methods: Cutting-plane methods and warm starts – volume: 10 start-page: 321 year: 2012 ident: 10.1016/j.ejor.2014.02.027_b0125 article-title: Semidefinite relaxations for partitioning, assignment and ordering problems publication-title: 40R-Quaterly Journal of Operations Research – volume: 20 start-page: 7 year: 1997 ident: 10.1016/j.ejor.2014.02.027_b0155 article-title: On the discrete lot-sizing and scheduling problem with Wagner–Whitin costs publication-title: Operations Research Letters doi: 10.1016/S0167-6377(96)00043-0 – volume: 48 start-page: 206 issue: 2 year: 2001 ident: 10.1016/j.ejor.2014.02.027_b0150 article-title: Convex quadratic and semidefinite programming relaxations in scheduling publication-title: Journal of the ACM doi: 10.1145/375827.375840 – volume: 44 start-page: 337 year: 1990 ident: 10.1016/j.ejor.2014.02.027_b0045 article-title: The discrete lot sizing and scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(90)90245-7 – volume: 100 start-page: 494 year: 1997 ident: 10.1016/j.ejor.2014.02.027_b0135 article-title: Solving the discrete lotsizing and scheduling problem with sequence dependant set-up costs and set-up times using the travelling salesman problem with time windows publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(96)00020-3 – volume: 10 start-page: 443 issue: 2 year: 2000 ident: 10.1016/j.ejor.2014.02.027_b0015 article-title: Solving large-scale sparse semidefinite programs for combinatorial optimization publication-title: SIAM Journal on Optimization doi: 10.1137/S1052623497328008 – volume: 6 start-page: 231 year: 2009 ident: 10.1016/j.ejor.2014.02.027_b0120 article-title: Copositive and semidefinite relaxations of the quadratic assignment problem publication-title: Discrete Optimisation doi: 10.1016/j.disopt.2009.01.002 – volume: 7 start-page: 51 year: 1995 ident: 10.1016/j.ejor.2014.02.027_b0115 article-title: A recipe for semidefinite relaxation of (0–1) quadratic programming publication-title: Journal of Global Optimization doi: 10.1007/BF01100205 – volume: 46 start-page: 1619 issue: 6 year: 2008 ident: 10.1016/j.ejor.2014.02.027_b0090 article-title: Modelling industrial lot sizing problems: A review publication-title: Industrial Journal of Production Research doi: 10.1080/00207540600902262 – volume: 136 start-page: 255 year: 2012 ident: 10.1016/j.ejor.2014.02.027_b0040 article-title: Single-stage formulations for synchronized two-stage lot-sizing and scheduling in soft drink production publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2011.11.028 – volume: 50 start-page: 79 year: 2006 ident: 10.1016/j.ejor.2014.02.027_b0145 article-title: Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2006.01.001 – volume: 8 start-page: 469 year: 2004 ident: 10.1016/j.ejor.2014.02.027_b0130 article-title: From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems publication-title: Journal of Combinatorial Optimization doi: 10.1007/s10878-004-4838-6 – ident: 10.1016/j.ejor.2014.02.027_b0065 – volume: 32 start-page: 2987 year: 2005 ident: 10.1016/j.ejor.2014.02.027_b0025 article-title: Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs publication-title: Computers & Operations Research doi: 10.1016/j.cor.2004.04.012 – volume: 4 start-page: 197 issue: 2 year: 2000 ident: 10.1016/j.ejor.2014.02.027_b0080 article-title: A semidefinite programming approach to the quadratic knapsack problem publication-title: Journal of Combinatorial Optimization doi: 10.1023/A:1009898604624 – volume: 37 start-page: 32 year: 2009 ident: 10.1016/j.ejor.2014.02.027_b0050 article-title: On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times publication-title: Operations Research Letters doi: 10.1016/j.orl.2008.10.001 – year: 2006 ident: 10.1016/j.ejor.2014.02.027_b0110 – volume: 1 start-page: 166 year: 1991 ident: 10.1016/j.ejor.2014.02.027_b0100 article-title: Cones of matrices and set-functions and 0–1 optimization publication-title: SIAM Journal on Optimization doi: 10.1137/0801013 – volume: 32 start-page: 231 year: 2010 ident: 10.1016/j.ejor.2014.02.027_b0020 article-title: Dynamic capacitated lot-sizing problems: Classification and review of solution approaches publication-title: OR Spectrum doi: 10.1007/s00291-008-0150-7 – volume: 10 start-page: 673 issue: 3 year: 2000 ident: 10.1016/j.ejor.2014.02.027_b0075 article-title: A spectral bundle method for semidefinite programming publication-title: SIAM Journal of Optimization doi: 10.1137/S1052623497328987 – volume: 137 start-page: 461 issue: 3 year: 2002 ident: 10.1016/j.ejor.2014.02.027_b0070 article-title: Semidefinite programming publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00143-6 – volume: 49 start-page: 2587 issue: 9 year: 2011 ident: 10.1016/j.ejor.2014.02.027_b0055 article-title: Exact solution approaches for the discrete lot-sizing and scheduling problem with identical parallel resources publication-title: International Journal of Production Research doi: 10.1080/00207543.2010.532927 – volume: 5 start-page: 89 issue: 1 year: 1958 ident: 10.1016/j.ejor.2014.02.027_b0160 article-title: Dynamic version of the economic lot size model publication-title: Management Science doi: 10.1287/mnsc.5.1.89 – start-page: 687 year: 2012 ident: 10.1016/j.ejor.2014.02.027_b0165 article-title: Latest developments in the SDPA family for solving large-scale SDPs doi: 10.1007/978-1-4614-0769-0_24 – volume: 35 start-page: 832 issue: 6 year: 1987 ident: 10.1016/j.ejor.2014.02.027_b0035 article-title: Solving multi-item capacitated lot-sizing problems using variable redefinition publication-title: Operations Research doi: 10.1287/opre.35.6.832 – volume: 47 start-page: 993 issue: 7 year: 2001 ident: 10.1016/j.ejor.2014.02.027_b0010 article-title: Modelling practical lot-sizing problems as mixed-integer programs publication-title: Management Science doi: 10.1287/mnsc.47.7.993.9800 – volume: 2 start-page: 71 year: 1998 ident: 10.1016/j.ejor.2014.02.027_b0170 article-title: Semidefinite programming relaxations for the quadratic assignment problem publication-title: Journal of Combinatorial Optimization doi: 10.1023/A:1009795911987 |
| SSID | ssj0001515 |
| Score | 2.1626859 |
| Snippet | •We study a lot-sizing problem with sequence-dependent changeover costs and times.•This problem is formulated as a quadratically constrained quadratic binary... The present work is intended as a first step towards applying semidefinite programming models and tools to discrete lot-sizing problems including... |
| SourceID | hal proquest crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 498 |
| SubjectTerms | Comparative analysis Competitive advantage Computation Computer programs Computer Science Cutting planes Discrete lot-sizing and scheduling problem Integer programming Lower bounds Manufacturing Mathematical models Mathematical problems Mathematical programming Operational research Operations Research Optimization Quadratic programming Quadratically constrained quadratic binary programming Semidefinite programming Semidefinite relaxation Sequence-dependent changeover costs and times Solution strengthening Studies |
| Title | An evaluation of semidefinite programming based approaches for discrete lot-sizing problems |
| URI | https://dx.doi.org/10.1016/j.ejor.2014.02.027 https://www.proquest.com/docview/1520421541 https://www.proquest.com/docview/1559651170 https://hal.science/hal-01120234 |
| Volume | 237 |
| WOSCitedRecordID | wos000336110000011&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: 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/eLvHCXMwtV1ta9RAEF6uVxH7wZdTsVplFb9JjmRvk00-HqVapS2CVQ78EPKyS3Nck3JvlP4Cf7Yz2ZcLLS0qCEc4Nptk72ay8-zszDOEvBd-lKgE87aUDD0-Kn0v8UvlRcwvfJVHpWhLsvw4Eicn8WSSfO31ftlcmPVM1HV8eZlc_FdRQxsIG1Nn_0Lc7qbQAN9B6HAEscPxjwQ_rjsU3ogFF_K8KqWqEF3aeKxz9BCgBSsdq7hsmRlwxwaAJPScNUtvUV3pbPW26sziVje-gbTQMLfORcMi5LzNn6oCTFDrcN4fujCgNhqgnZ9c23FVN6vWJB4Puz6JgLugK-Mou5EsoxO0hPAY06maQ6nn21gwL4p1SQE7ITNNA2M0j3WmV64rVhtLHep6uTeMgPZHTIdy2iDja8BbVlYmNibPBSJ-w0HhmGCdiVx7ky2yzUSYxH2yPf58MPnirDoCv3ZHyvwIk4ClYwWvP-k2kLN1htG214x-i2ROH5OHZglCx1p1npCerAfkvs2AGJBHttIHNRP_gOx0aCufkp_jmm5UjDaKdlWMdlSMtipGNypGQcWoVTG6UTFqVewZ-f7x4HT_0DNFOryCC3_pZVyIIGeZHOFKOVZhyZLcT1gBQJD7TCEBksxkoeI4zGOF8BIW0bKQWchUkmej56RfN7V8QajgJQ9lXo6gH4_8IC4VZ6zgWVYGkRyJXRLYfzUtDIM9FlKZpTZUcZqiJFKUROoz-MA1H9w1F5q_5c7eoRVWahCoRpYp6Nad170DyboHIGX74fgoxTawnwxwMV8Hu2TPCj41r-YiBfgMZhPWMXD6rTsNUzzu22W1bFbYJ0yiEEtEvfzH8b0iDzav6R7pL-cr-ZrcK9bLajF_Y1T9NzUGzYo |
| 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=An+evaluation+of+semidefinite+programming+based+approaches+for+discrete+lot-sizing+problems&rft.jtitle=European+journal+of+operational+research&rft.au=Gicquel%2C+C.&rft.au=Lisser%2C+A.&rft.au=Minoux%2C+M.&rft.date=2014-09-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=237&rft.issue=2&rft.spage=498&rft.epage=507&rft_id=info:doi/10.1016%2Fj.ejor.2014.02.027&rft.externalDocID=S037722171400160X |
| 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 |