Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling
In this work we propose a Lagrangian relaxation of a time indexed integer programming formulation to compute a lower bound for the resource-constrained modulo scheduling problem (RCMSP). Solving the RCMSP consists in finding a 1-periodic schedule minimizing the period subject to both temporal and re...
Saved in:
| Published in | Electronic notes in discrete mathematics Vol. 36; pp. 191 - 198 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
01.08.2010
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1571-0653 1571-0653 |
| DOI | 10.1016/j.endm.2010.05.025 |
Cover
| Abstract | In this work we propose a Lagrangian relaxation of a time indexed integer programming formulation to compute a lower bound for the resource-constrained modulo scheduling problem (RCMSP). Solving the RCMSP consists in finding a 1-periodic schedule minimizing the period subject to both temporal and resource constraints. This work is inspired by Möhring
et al results [Möhring, R.H., A. S. Schulz, F. Stork and M. Uetz
Solving Project Scheduling Problems by Minimum Cut Computations, Management Science. 49 (2003), 330–350] for the (non cyclic) resource constrained project scheduling problem, where each subproblem solved within the subgradient optimization is equivalent to a minimum cut problem. Experimental results, presented on instruction scheduling instances from the STMicroelectronics ST200 VLIW processor family, underline the interest of the proposed method. |
|---|---|
| AbstractList | In this work we propose a Lagrangian relaxation of a time indexed integer programming formulation to compute a lower bound for the resource-constrained modulo scheduling problem (RCMSP). Solving the RCMSP consists in finding a 1-periodic schedule minimizing the period subject to both temporal and resource constraints. This work is inspired by Möhring
et al results [Möhring, R.H., A. S. Schulz, F. Stork and M. Uetz
Solving Project Scheduling Problems by Minimum Cut Computations, Management Science. 49 (2003), 330–350] for the (non cyclic) resource constrained project scheduling problem, where each subproblem solved within the subgradient optimization is equivalent to a minimum cut problem. Experimental results, presented on instruction scheduling instances from the STMicroelectronics ST200 VLIW processor family, underline the interest of the proposed method. |
| Author | Ayala, Maria Gacias, Bernat Artigues, Christian |
| Author_xml | – sequence: 1 givenname: Maria surname: Ayala fullname: Ayala, Maria email: maria.ayala@laas.fr organization: CNRS; LAAS; 7 avenue du Colonel Roche, F-31077 Toulouse, France – sequence: 2 givenname: Christian surname: Artigues fullname: Artigues, Christian email: christian.artigues@laas.fr organization: CNRS; LAAS; 7 avenue du Colonel Roche, F-31077 Toulouse, France – sequence: 3 givenname: Bernat surname: Gacias fullname: Gacias, Bernat email: bernat.gacias@laas.fr organization: CNRS; LAAS; 7 avenue du Colonel Roche, F-31077 Toulouse, France |
| BookMark | eNp9kE1LxDAQhoOs4O7qH_DUP9CatE23BS-yqCssCKLnMEmma0qbSNL149-buh7Ew55mGN5n4HkXZGadRUIuGc0YZdVVl6HVQ5bTeKA8ozk_IXPGVyylFS9mf_Yzsgiho7So2YrPydMWdh7szoBNPPbwCaNxNpUQUCe9-0CfSLe3Ommdj4Hg9l5hqpwNowdjY2hwet-7JKhXjIuxu3Ny2kIf8OJ3LsnL3e3zepNuH-8f1jfbVOU1G9OWgaaqrGpV8ko2OcoGGY0CyCopa-ANY3nFOS9lA9BCq8uiUZIWU7iApliS_PBXeReCx1a8eTOA_xKMiqkV0YmpFTG1IigXsZUI1f8gZcYf58mnP45eH1CMUu8GvQjKoFWojUc1Cu3MMfwbJFaBeQ |
| CitedBy_id | crossref_primary_10_1145_3035483 crossref_primary_10_1080_00207543_2012_676681 crossref_primary_10_1007_s10589_012_9499_2 crossref_primary_10_3390_app11010397 crossref_primary_10_1016_j_artint_2013_09_006 |
| Cites_doi | 10.1002/9780470611227.ch18 10.1007/BFb0120697 10.1016/0377-2217(87)90240-2 10.1287/mnsc.49.3.330.12737 |
| ContentType | Journal Article |
| Copyright | 2010 Elsevier B.V. |
| Copyright_xml | – notice: 2010 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.endm.2010.05.025 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1571-0653 |
| EndPage | 198 |
| ExternalDocumentID | 10_1016_j_endm_2010_05_025 S1571065310000260 |
| GroupedDBID | --K --M .~1 0R~ 1B1 1~. 1~5 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AASFE AAXUO ABAOU ABJNI ABMAC ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNNM ACRLP ACXMD ADBBV ADEZE ADGUI ADMUD AEBSH AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AIEXJ AIGVJ AIKHN AITUG AJMQA AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM M41 MHUIS MO0 M~E N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K ~G- AATTM AAXKI AAYWO AAYXX ABWVN ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFPUW AFXIZ AGCQF AGQPQ AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU CITATION SSH |
| ID | FETCH-LOGICAL-c281t-f1ad0c468c456b92eb9e10010e16bb8a5911265554b9aafafd439cb036b923a93 |
| IEDL.DBID | .~1 |
| ISSN | 1571-0653 |
| IngestDate | Thu Apr 24 22:54:34 EDT 2025 Tue Jul 01 00:41:06 EDT 2025 Fri Feb 23 02:23:32 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | lagrangian relaxation modulo scheduling resource constraints minimum period |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c281t-f1ad0c468c456b92eb9e10010e16bb8a5911265554b9aafafd439cb036b923a93 |
| PageCount | 8 |
| ParticipantIDs | crossref_primary_10_1016_j_endm_2010_05_025 crossref_citationtrail_10_1016_j_endm_2010_05_025 elsevier_sciencedirect_doi_10_1016_j_endm_2010_05_025 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2010-08-00 |
| PublicationDateYYYYMMDD | 2010-08-01 |
| PublicationDate_xml | – month: 08 year: 2010 text: 2010-08-00 |
| PublicationDecade | 2010 |
| PublicationTitle | Electronic notes in discrete mathematics |
| PublicationYear | 2010 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Camerini, Fratta, Maffioli (bib001) 1975; 3 Dupont de Dinechin (bib003) 2004 Möhring, Schulz, Stork, Uetz (bib005) 2003; 49 Christofides, Alvarez-Valds, Tamarit (bib002) 1987; 29 Dupont de Dinechin B, Christian Artigues, Sadia Azem in Resource-Constrained Project Scheduling. models, Algorithms, Extensions and Applications by Christian Artigues, Sophie Demassey and Emmanuel Néron (2008) Dupont de Dinechin (10.1016/j.endm.2010.05.025_bib003) 2004 Camerini (10.1016/j.endm.2010.05.025_bib001) 1975; 3 Christofides (10.1016/j.endm.2010.05.025_bib002) 1987; 29 10.1016/j.endm.2010.05.025_bib004 Möhring (10.1016/j.endm.2010.05.025_bib005) 2003; 49 |
| References_xml | – reference: Dupont de Dinechin B, Christian Artigues, Sadia Azem, – volume: 29 start-page: 262 year: 1987 end-page: 273 ident: bib002 article-title: Project scheduling with resource constraints: a branch and bound approach publication-title: European Journal of Operational Research. – volume: 49 start-page: 330 year: 2003 end-page: 350 ident: bib005 article-title: Solving Project Scheduling Problems by Minimum Cut Computations publication-title: Management Science – year: 2004 ident: bib003 article-title: From Machine Scheduling to VLIW Instruction Scheduling publication-title: ST Journal of Research – volume: 3 start-page: 26 year: 1975 end-page: 34 ident: bib001 article-title: On improving relaxation methods by modified gradient techniques publication-title: Math. Programming Stud. – reference: , in Resource-Constrained Project Scheduling. models, Algorithms, Extensions and Applications by Christian Artigues, Sophie Demassey and Emmanuel Néron (2008) – ident: 10.1016/j.endm.2010.05.025_bib004 doi: 10.1002/9780470611227.ch18 – year: 2004 ident: 10.1016/j.endm.2010.05.025_bib003 article-title: From Machine Scheduling to VLIW Instruction Scheduling publication-title: ST Journal of Research – volume: 3 start-page: 26 year: 1975 ident: 10.1016/j.endm.2010.05.025_bib001 article-title: On improving relaxation methods by modified gradient techniques publication-title: Math. Programming Stud. doi: 10.1007/BFb0120697 – volume: 29 start-page: 262 year: 1987 ident: 10.1016/j.endm.2010.05.025_bib002 article-title: Project scheduling with resource constraints: a branch and bound approach publication-title: European Journal of Operational Research. doi: 10.1016/0377-2217(87)90240-2 – volume: 49 start-page: 330 year: 2003 ident: 10.1016/j.endm.2010.05.025_bib005 article-title: Solving Project Scheduling Problems by Minimum Cut Computations publication-title: Management Science doi: 10.1287/mnsc.49.3.330.12737 |
| SSID | ssj0038175 |
| Score | 1.7901083 |
| Snippet | In this work we propose a Lagrangian relaxation of a time indexed integer programming formulation to compute a lower bound for the resource-constrained modulo... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 191 |
| SubjectTerms | lagrangian relaxation minimum period modulo scheduling resource constraints |
| Title | Lagrangian relaxation-based lower bound for resource-constrained modulo scheduling |
| URI | https://dx.doi.org/10.1016/j.endm.2010.05.025 |
| Volume | 36 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEF5KvXjxLdZH2YM3SZs02SR7LMVStRapFnpbdje7pdIX0oInf7szyaYoSA-eAmEWlslkvm-Xb2YIuW2ZWKXcMk-xOIMDSqI8ybX1WGi50lZJk3fbfx7EvVH0OGbjCumUtTAoq3S5v8jpebZ2b5rOm83VdNp8DRigY8yKG2qg5VjBHiUY642vrcwDG9CxvGdqggofFrrCmULjZRbZ3Mm7WMPHcdl_gdMPwOkekQPHFGm72MwxqZjFCTkspzBQ91OekmFfTgBwJvCdKVamfOa-9hCeMjrDIWhU4ewkCvQUDIrbek8jL8TxEGA0X2ab2ZLCORdwB8vTz8ioe__W6XluUoKnW2mw9mwgM19HcaqBDyneMoobbK7kmyBWKpWMY6UQA-qguJRW2gx4iFaAXmAcSh6ek-piuTAXhIbMxDLQmUz8NAqAHyqjIg2HKiujhPu6RoLSRUK7NuK43Zko9WLvAt0q0K3CZwLcWiN32zWroonGTmtWel78CgUBWX7Hust_rrsi-4UkAFV916S6_tiYG2Aaa1XPQ6lO9tqdYf8Fnw9PvcE3sDHVpA |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1La8MwDBZde9gue491zxx2G1mTJk7iYykr7fo4bC30ZmzHKR19MVrYz5_UOGOD0cOuQQbzxZY-mU8SwEPdRCrhGXMVi1JMUGLlSq4zlwUZVzpT0my77fcHUXsUvozZuATNohaGZJXW9-c-feut7ZeaRbO2mk5rbz7D6Bix_IUaafkeVEKG2V4ZKo1Otz0oHDL1oGPbtqkxiXxYYGtncpmXWaRzq_BiTx5NzP4rPv2IOa1jOLRk0Wnk-zmBklmcwlExiMGx9_IMXntygjFngr_aoeKUzy3cLkWo1JnRHDRH0fgkBxkqGuQP9q4makgTItBovkw3s6WDqS6GHqpQP4dR63nYbLt2WIKr64m_djNfpp4Oo0QjJVK8bhQ31F_JM36kVCIZp2IhhuxBcSkzmaVIRbTCAIbGgeTBBZQXy4W5BCdgJpK-TmXsJaGPFFEZFWrMqzIZxtzTVfALiIS2ncRpuzNRSMbeBcEqCFbhMYGwVuHxe80q76Ox05oVyItfp0Ggo9-x7uqf6-5hvz3s90SvM-hew0GuECCR3w2U1x8bc4vEY63u7MH6Amr_1sY |
| 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=Lagrangian+relaxation-based+lower+bound+for+resource-constrained+modulo+scheduling&rft.jtitle=Electronic+notes+in+discrete+mathematics&rft.au=Ayala%2C+Maria&rft.au=Artigues%2C+Christian&rft.au=Gacias%2C+Bernat&rft.date=2010-08-01&rft.issn=1571-0653&rft.eissn=1571-0653&rft.volume=36&rft.spage=191&rft.epage=198&rft_id=info:doi/10.1016%2Fj.endm.2010.05.025&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_endm_2010_05_025 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1571-0653&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1571-0653&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1571-0653&client=summon |