A polynomial time algorithm for production planning with bounded inventory
In petrochemical manufacturing, food processing, glass manufacturing, etc., there is a situation where the production planning is subject to the limit of inventory capacity (or bounded inventory) rather than production capacity. Only a few studies can be found in the literature for this situation. I...
Uloženo v:
| Vydáno v: | International journal of advanced manufacturing technology Ročník 39; číslo 7-8; s. 774 - 782 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
London
Springer-Verlag
01.11.2008
Springer Nature B.V |
| Témata: | |
| ISSN: | 0268-3768, 1433-3015 |
| 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 | In petrochemical manufacturing, food processing, glass manufacturing, etc., there is a situation where the production planning is subject to the limit of inventory capacity (or bounded inventory) rather than production capacity. Only a few studies can be found in the literature for this situation. In this paper, the production planning problem with bounded inventory is discussed. Specifically, the problem considered had the following features: (i) backlogging is not allowed, (ii) lost sale is allowed, (iii) the lost sale cost function is time varying and non-increasing, and (iv) inventory capacity is non-decreasing. An algorithm for this problem with the polynomial O(
T
3
) time complexity is proposed. Though the complexity of the algorithm is the same as that of the other work, see Sandbothe and Thompson (Oper Res 38(3):474–486,
1990
), the problem in the other’s work problem is less complex than ours; for instance only a fixed cost function is considered. A case study taken from a real-life production line is provided to further justify the application of the lost sale strategy, demonstrating the effectiveness of our model and algorithm. |
|---|---|
| AbstractList | In petrochemical manufacturing, food processing, glass manufacturing, etc., there is a situation where the production planning is subject to the limit of inventory capacity (or bounded inventory) rather than production capacity. Only a few studies can be found in the literature for this situation. In this paper, the production planning problem with bounded inventory is discussed. Specifically, the problem considered had the following features: (i) backlogging is not allowed, (ii) lost sale is allowed, (iii) the lost sale cost function is time varying and non-increasing, and (iv) inventory capacity is non-decreasing. An algorithm for this problem with the polynomial O(T3) time complexity is proposed. Though the complexity of the algorithm is the same as that of the other work, see Sandbothe and Thompson (Oper Res 38(3):474–486, 1990), the problem in the other’s work problem is less complex than ours; for instance only a fixed cost function is considered. A case study taken from a real-life production line is provided to further justify the application of the lost sale strategy, demonstrating the effectiveness of our model and algorithm. In petrochemical manufacturing, food processing, glass manufacturing, etc., there is a situation where the production planning is subject to the limit of inventory capacity (or bounded inventory) rather than production capacity. Only a few studies can be found in the literature for this situation. In this paper, the production planning problem with bounded inventory is discussed. Specifically, the problem considered had the following features: (i) backlogging is not allowed, (ii) lost sale is allowed, (iii) the lost sale cost function is time varying and non-increasing, and (iv) inventory capacity is non-decreasing. An algorithm for this problem with the polynomial O( T 3 ) time complexity is proposed. Though the complexity of the algorithm is the same as that of the other work, see Sandbothe and Thompson (Oper Res 38(3):474–486, 1990 ), the problem in the other’s work problem is less complex than ours; for instance only a fixed cost function is considered. A case study taken from a real-life production line is provided to further justify the application of the lost sale strategy, demonstrating the effectiveness of our model and algorithm. |
| Author | Liu, X. |
| Author_xml | – sequence: 1 givenname: X. surname: Liu fullname: Liu, X. email: xialiu@ucalgary.ca organization: School of Business Administration, Northeastern University, Department of Mechanical and Manufacturing Engineering, University of Calgary |
| BookMark | eNp9kE1LxDAQhoOs4O7qD_AW8BzNR5u0x2XxkwUveg7ZNF2ztElNU6X_3pQKgqCnGZj3mXnnXYGF884AcEnwNcFY3PQYE4FRahGhGUfjCViSjDHEMMkXYIkpLxATvDgDq74_JjUnvFiCpw3sfDM631rVwGhbA1Vz8MHGtxbWPsAu-GrQ0XoHu0Y5Z90BfqYp3PvBVaaC1n0YF30Yz8FprZreXHzXNXi9u33ZPqDd8_3jdrNDmhEekc5qQ0vKSZ7zzJSsFLzkmlO8z4lglGlhSqVEQTXVShBaVDmvtarrjFeVxnu2Blfz3mTtfTB9lEc_BJdOSko5zTHPSpJUZFbp4Ps-mFp2wbYqjJJgOUUm58jk1E6RyTEx4hejbVTT7zEo2_xL0pns0xV3MOHH09_QF0QFgxI |
| CitedBy_id | crossref_primary_10_1080_0951192X_2017_1335436 crossref_primary_10_1016_j_omega_2021_102421 |
| Cites_doi | 10.1016/0377-2217(90)90152-2 10.1287/mnsc.21.9.1007 10.1016/S0020-0255(03)00065-3 10.1016/S0305-0548(01)00105-8 10.1016/0377-2217(94)90086-8 10.1016/j.ins.2005.11.004 10.1287/opre.38.3.474 10.1016/j.cor.2005.02.046 10.1016/j.cor.2005.05.029 10.1287/opre.1050.0223 10.1007/BF01098363 10.1016/0305-0548(93)90010-G 10.1016/S0377-2217(02)00331-4 10.1287/mnsc.44.6.831 10.1287/mnsc.28.10.1174 10.1287/mnsc.20.3.313 10.1287/opre.40.1.S145 10.1287/mnsc.15.9.506 10.1287/opre.41.3.549 10.1287/mnsc.24.16.1710 10.1287/mnsc.18.1.12 10.1287/mnsc.14.7.429 10.1287/mnsc.37.8.909 10.1287/mnsc.26.7.669 10.1287/mnsc.42.1.142 10.1287/mnsc.5.1.89 |
| ContentType | Journal Article |
| Copyright | Springer-Verlag London Limited 2007 The International Journal of Advanced Manufacturing Technology is a copyright of Springer, (2007). All Rights Reserved. |
| Copyright_xml | – notice: Springer-Verlag London Limited 2007 – notice: The International Journal of Advanced Manufacturing Technology is a copyright of Springer, (2007). All Rights Reserved. |
| DBID | AAYXX CITATION 8FE 8FG ABJCF AFKRA BENPR BGLVJ CCPQU DWQXO HCIFZ L6V M7S PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.1007/s00170-007-1246-y |
| DatabaseName | CrossRef ProQuest SciTech Collection ProQuest Technology Collection Materials Science & Engineering Collection ProQuest Central UK/Ireland ProQuest Central Technology collection ProQuest One Community College ProQuest Central Korea SciTech Premium Collection ProQuest Engineering Collection Engineering Database ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection |
| DatabaseTitle | CrossRef Engineering Database Technology Collection ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition SciTech Premium Collection ProQuest One Community College ProQuest Technology Collection ProQuest SciTech Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest One Academic UKI Edition ProQuest Central Korea Materials Science & Engineering Collection ProQuest One Academic ProQuest Central (New) Engineering Collection ProQuest One Academic (New) |
| DatabaseTitleList | Engineering Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1433-3015 |
| EndPage | 782 |
| ExternalDocumentID | 10_1007_s00170_007_1246_y |
| GroupedDBID | -5B -5G -BR -EM -XW -XX -Y2 -~C .86 .VR 06D 0R~ 0VY 123 1N0 1SB 203 28- 29J 29~ 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 8FE 8FG 8TC 8UJ 95- 95. 95~ 96X 9M8 AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTD ABFTV ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADMLS ADQRH ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARCEE ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. B0M BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EAD EAP EAS EBLON EBS EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW L6V LAS LLZTM M4Y M7S MA- ML~ N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9P PF0 PT4 PT5 PTHSS QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SCV SDH SDM SEG SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z5O Z7R Z7S Z7V Z7W Z7X Z7Y Z7Z Z81 Z83 Z85 Z86 Z88 Z8M Z8N Z8P Z8Q Z8R Z8S Z8T Z8U Z8V Z8W Z8Z Z92 ZMTXR ZY4 _50 ~8M ~A9 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB DWQXO PKEHL PQEST PQQKQ PQUKI PRINS |
| ID | FETCH-LOGICAL-c316t-c4fe292615564e9397696c620b517323c7e9aa782c2ca7128d56fcaff46ddc0b3 |
| IEDL.DBID | M7S |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000259961500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0268-3768 |
| IngestDate | Tue Nov 04 23:14:50 EST 2025 Sat Nov 29 05:50:42 EST 2025 Tue Nov 18 21:34:51 EST 2025 Fri Feb 21 02:30:51 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7-8 |
| Keywords | Inventory capacity Lost sale Stockout Dynamic programming Production planning |
| Language | English |
| License | http://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c316t-c4fe292615564e9397696c620b517323c7e9aa782c2ca7128d56fcaff46ddc0b3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 2262506491 |
| PQPubID | 2044010 |
| PageCount | 9 |
| ParticipantIDs | proquest_journals_2262506491 crossref_primary_10_1007_s00170_007_1246_y crossref_citationtrail_10_1007_s00170_007_1246_y springer_journals_10_1007_s00170_007_1246_y |
| PublicationCentury | 2000 |
| PublicationDate | 20081100 2008-11-00 20081101 |
| PublicationDateYYYYMMDD | 2008-11-01 |
| PublicationDate_xml | – month: 11 year: 2008 text: 20081100 |
| PublicationDecade | 2000 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: Heidelberg |
| PublicationTitle | International journal of advanced manufacturing technology |
| PublicationTitleAbbrev | Int J Adv Manuf Technol |
| PublicationYear | 2008 |
| Publisher | Springer-Verlag Springer Nature B.V |
| Publisher_xml | – name: Springer-Verlag – name: Springer Nature B.V |
| References | Aggarwal, Park (CR5) 1993; 41 Shaw, Wagelmans (CR14) 1998; 44 Bitran, Yanasse (CR16) 1982; 28 Gutierrez, Sedeno-Noda, Colebrook, Sicilia (CR19) 2002; 30 Gutierrez, Sedeno-Noda, Colebrook, Sicilia (CR20) 2007; 34 Aksen, Altinkemer, Chand (CR24) 2003; 147 Zangwill (CR26) 1968; 14 Wagner, Whitin (CR4) 1958; 5 Florian, Lenstra, Rinnooy (CR8) 1980; 26 Baker, Dixon, Magazine, Silver (CR15) 1978; 24 Erensal, Oncan, Demircan (CR2) 2006; 176 Wagelmans, Hoesel, Kolen (CR7) 1992; 40 Swoveland (CR11) 1975; 21 Chen, Hean (CR13) 1994; 4 Zangwill (CR27) 1969; 15 Sandbothe, Thompson (CR1) 1990; 38 Sandbothe, Thompson (CR23) 1993; 20 Federgruen, Tzur (CR6) 1991; 37 CR25 Atamturk, Kucukyavuz (CR21) 2005; 53 Shang, Fromherz (CR3) 2003; 153 Hoesel, Wagelmans (CR10) 1996; 42 Heuvel, Wagelmans (CR22) 2006; 33 Chung, Lin (CR17) 1994; 75 Kirca (CR12) 1990; 45 Florian, Klein (CR9) 1971; 18 Love (CR18) 1973; 20 YC Erensal (1246_CR2) 2006; 176 HD Chen (1246_CR13) 1994; 4 CPMV Hoesel (1246_CR10) 1996; 42 1246_CR25 WI Zangwill (1246_CR26) 1968; 14 SF Love (1246_CR18) 1973; 20 RA Sandbothe (1246_CR23) 1993; 20 A Atamturk (1246_CR21) 2005; 53 Y Shang (1246_CR3) 2003; 153 CA Swoveland (1246_CR11) 1975; 21 O Kirca (1246_CR12) 1990; 45 RA Sandbothe (1246_CR1) 1990; 38 WI Zangwill (1246_CR27) 1969; 15 J Gutierrez (1246_CR19) 2002; 30 M Florian (1246_CR8) 1980; 26 DX Shaw (1246_CR14) 1998; 44 KB Baker (1246_CR15) 1978; 24 D Aksen (1246_CR24) 2003; 147 GR Bitran (1246_CR16) 1982; 28 WVD Heuvel (1246_CR22) 2006; 33 A Federgruen (1246_CR6) 1991; 37 J Gutierrez (1246_CR20) 2007; 34 M Florian (1246_CR9) 1971; 18 HM Wagner (1246_CR4) 1958; 5 A Aggarwal (1246_CR5) 1993; 41 CSF Chung (1246_CR17) 1994; 75 A Wagelmans (1246_CR7) 1992; 40 |
| References_xml | – volume: 37 start-page: 909 year: 1991 end-page: 925 ident: CR6 article-title: A single forward algorithm to solve general dynamic lot sizing models with periods in ( log ) or ( ) time publication-title: Manag Sci – volume: 44 start-page: 831 year: 1998 end-page: 838 ident: CR14 article-title: An algorithm for single item capacitated economic lot-sizing with piecewise linear production costs and general holding costs publication-title: Manag Sci – volume: 45 start-page: 15 year: 1990 end-page: 24 ident: CR12 article-title: An efficient algorithm for the capacitated single item dynamic lot size problem publication-title: Eur J Oper Res doi: 10.1016/0377-2217(90)90152-2 – volume: 21 start-page: 1007 issue: 9 year: 1975 end-page: 1013 ident: CR11 article-title: Deterministic multi-period production planning model with piecewise concave production and holding-backorder costs publication-title: Manag Sci doi: 10.1287/mnsc.21.9.1007 – volume: 153 start-page: 1 year: 2003 end-page: 36 ident: CR3 article-title: Experimental complexity analysis of continuous constraint satisfaction problems publication-title: Inform Sci doi: 10.1016/S0020-0255(03)00065-3 – volume: 30 start-page: 383 year: 2002 end-page: 395 ident: CR19 article-title: A new characterization for the dynamic lot size problem with bounded inventory publication-title: Comput & Oper Res doi: 10.1016/S0305-0548(01)00105-8 – volume: 75 start-page: 427 year: 1994 end-page: 440 ident: CR17 article-title: An effective algorithm for the capacitated single item lot size problem publication-title: Eur J Oper Res doi: 10.1016/0377-2217(94)90086-8 – volume: 176 start-page: 2755 year: 2006 end-page: 2770 ident: CR2 article-title: Determining key capabilities in technology management using fuzzy analytic hierarchy process: A case study of Turkey publication-title: Inform Sci doi: 10.1016/j.ins.2005.11.004 – volume: 38 start-page: 474 issue: 3 year: 1990 end-page: 486 ident: CR1 article-title: A forward algorithm for the capacitated lot size model with stockouts publication-title: Oper Res doi: 10.1287/opre.38.3.474 – volume: 33 start-page: 3583 year: 2006 end-page: 3599 ident: CR22 article-title: An efficient dynamic programming algorithm for a special case of the capacitated lot sizing problem publication-title: Comput & Oper Res doi: 10.1016/j.cor.2005.02.046 – volume: 28 start-page: 1174 issue: 10 year: 1982 end-page: 1186 ident: CR16 article-title: Computational complexity of the capacitated lot size problem publication-title: Manag Sci – volume: 18 start-page: 12 issue: 1 year: 1971 end-page: 20 ident: CR9 article-title: Deterministic production planning with concave costs and capacity constraints publication-title: Manag Sci – ident: CR25 – volume: 34 start-page: 934 issue: 4 year: 2007 end-page: 937 ident: CR20 article-title: A polynomial algorithm for the production/ordering planning problem with limited storage publication-title: Comput & Oper Res doi: 10.1016/j.cor.2005.05.029 – volume: 20 start-page: 313 issue: 3 year: 1973 end-page: 318 ident: CR18 article-title: Bounded production and inventory models with piecewise concave costs publication-title: Manag Sci – volume: 40 start-page: 145 year: 1992 end-page: 156 ident: CR7 article-title: Economic lot-sizing: An ( log ) algorithm that runs in linear time in the Wagner-Whitin case publication-title: Oper Res – volume: 53 start-page: 711 issue: 4 year: 2005 end-page: 730 ident: CR21 article-title: Lot sizing with inventory bounds and fixed costs: Polyhedral study and computation publication-title: Oper Res doi: 10.1287/opre.1050.0223 – volume: 4 start-page: 285 year: 1994 end-page: 330 ident: CR13 article-title: A new dynamic programming algorithm for the single item capacitated dynamic lot size model publication-title: J Global Optim doi: 10.1007/BF01098363 – volume: 41 start-page: 549 issue: 3 year: 1993 end-page: 571 ident: CR5 article-title: Improved algorithms for economic lot-size problems publication-title: Oper Res – volume: 26 start-page: 669 issue: 7 year: 1980 end-page: 679 ident: CR8 article-title: Deterministic production planning: Algorithm and complexity publication-title: Manag Sci – volume: 20 start-page: 455 issue: 5 year: 1993 end-page: 465 ident: CR23 article-title: Decision horizons for the capacitated lot size model with inventory bounds and stockouts publication-title: Comput Oper Res doi: 10.1016/0305-0548(93)90010-G – volume: 14 start-page: 429 issue: 9 year: 1968 end-page: 450 ident: CR26 article-title: Minimum concave cost flows in certain networks publication-title: Manag Sci – volume: 147 start-page: 558 year: 2003 end-page: 566 ident: CR24 article-title: The single-item lot sizing production with immediate lost sales publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(02)00331-4 – volume: 5 start-page: 89 year: 1958 end-page: 96 ident: CR4 article-title: Dynamic version of the economic lot size model publication-title: Manag Sci – volume: 42 start-page: 142 year: 1996 end-page: 150 ident: CR10 article-title: An ( ) algorithm for the economic lot-sizing problem with constant capacities publication-title: Manag Sci – volume: 24 start-page: 1710 issue: 16 year: 1978 end-page: 1720 ident: CR15 article-title: An algorithm for the dynamic lot-size problem with time-varying production capacity constraints publication-title: Manag Sci – volume: 15 start-page: 506 issue: 9 year: 1969 end-page: 527 ident: CR27 article-title: A backlogging model and a multi-echelon model of a dynamic economic lot size production system – a network approach publication-title: Manag Sci – volume: 147 start-page: 558 year: 2003 ident: 1246_CR24 publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(02)00331-4 – volume: 44 start-page: 831 year: 1998 ident: 1246_CR14 publication-title: Manag Sci doi: 10.1287/mnsc.44.6.831 – volume: 28 start-page: 1174 issue: 10 year: 1982 ident: 1246_CR16 publication-title: Manag Sci doi: 10.1287/mnsc.28.10.1174 – volume: 45 start-page: 15 year: 1990 ident: 1246_CR12 publication-title: Eur J Oper Res doi: 10.1016/0377-2217(90)90152-2 – volume: 20 start-page: 313 issue: 3 year: 1973 ident: 1246_CR18 publication-title: Manag Sci doi: 10.1287/mnsc.20.3.313 – volume: 40 start-page: 145 year: 1992 ident: 1246_CR7 publication-title: Oper Res doi: 10.1287/opre.40.1.S145 – ident: 1246_CR25 – volume: 15 start-page: 506 issue: 9 year: 1969 ident: 1246_CR27 publication-title: Manag Sci doi: 10.1287/mnsc.15.9.506 – volume: 41 start-page: 549 issue: 3 year: 1993 ident: 1246_CR5 publication-title: Oper Res doi: 10.1287/opre.41.3.549 – volume: 176 start-page: 2755 year: 2006 ident: 1246_CR2 publication-title: Inform Sci doi: 10.1016/j.ins.2005.11.004 – volume: 24 start-page: 1710 issue: 16 year: 1978 ident: 1246_CR15 publication-title: Manag Sci doi: 10.1287/mnsc.24.16.1710 – volume: 153 start-page: 1 year: 2003 ident: 1246_CR3 publication-title: Inform Sci doi: 10.1016/S0020-0255(03)00065-3 – volume: 18 start-page: 12 issue: 1 year: 1971 ident: 1246_CR9 publication-title: Manag Sci doi: 10.1287/mnsc.18.1.12 – volume: 33 start-page: 3583 year: 2006 ident: 1246_CR22 publication-title: Comput & Oper Res doi: 10.1016/j.cor.2005.02.046 – volume: 14 start-page: 429 issue: 9 year: 1968 ident: 1246_CR26 publication-title: Manag Sci doi: 10.1287/mnsc.14.7.429 – volume: 21 start-page: 1007 issue: 9 year: 1975 ident: 1246_CR11 publication-title: Manag Sci doi: 10.1287/mnsc.21.9.1007 – volume: 38 start-page: 474 issue: 3 year: 1990 ident: 1246_CR1 publication-title: Oper Res doi: 10.1287/opre.38.3.474 – volume: 37 start-page: 909 year: 1991 ident: 1246_CR6 publication-title: Manag Sci doi: 10.1287/mnsc.37.8.909 – volume: 30 start-page: 383 year: 2002 ident: 1246_CR19 publication-title: Comput & Oper Res doi: 10.1016/S0305-0548(01)00105-8 – volume: 20 start-page: 455 issue: 5 year: 1993 ident: 1246_CR23 publication-title: Comput Oper Res doi: 10.1016/0305-0548(93)90010-G – volume: 75 start-page: 427 year: 1994 ident: 1246_CR17 publication-title: Eur J Oper Res doi: 10.1016/0377-2217(94)90086-8 – volume: 26 start-page: 669 issue: 7 year: 1980 ident: 1246_CR8 publication-title: Manag Sci doi: 10.1287/mnsc.26.7.669 – volume: 42 start-page: 142 year: 1996 ident: 1246_CR10 publication-title: Manag Sci doi: 10.1287/mnsc.42.1.142 – volume: 53 start-page: 711 issue: 4 year: 2005 ident: 1246_CR21 publication-title: Oper Res doi: 10.1287/opre.1050.0223 – volume: 5 start-page: 89 year: 1958 ident: 1246_CR4 publication-title: Manag Sci doi: 10.1287/mnsc.5.1.89 – volume: 4 start-page: 285 year: 1994 ident: 1246_CR13 publication-title: J Global Optim doi: 10.1007/BF01098363 – volume: 34 start-page: 934 issue: 4 year: 2007 ident: 1246_CR20 publication-title: Comput & Oper Res doi: 10.1016/j.cor.2005.05.029 |
| SSID | ssj0016168 ssib034539549 ssib019759004 ssib029851711 |
| Score | 1.8639064 |
| Snippet | In petrochemical manufacturing, food processing, glass manufacturing, etc., there is a situation where the production planning is subject to the limit of... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 774 |
| SubjectTerms | Algorithms CAE) and Design Complexity Computer-Aided Engineering (CAD Cost function Engineering Food processing Industrial and Production Engineering Mechanical Engineering Media Management Original Article Polynomials Production capacity Production planning |
| SummonAdditionalLinks | – databaseName: Springer LINK dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwEA86fdAHv8XplDz4pATaJEubxyEO8WGIX-ytJGmqg7mWbQr7781lbaeigr4Vcmnp5a53zeV-P4RORRRwzWJNYmo14TwVRMeKkixKM54ZZtJAe7KJqNeL-315U_ZxT6rT7lVJ0n-p62Y3D_VCYGvNxSRBZstoxUW7GLzx9u6xMqJQRkCEWRsZlcA-vzBixttsXtoqSw0i9P1y7l8kBm-Lq9Lnd4_8HLwWGemXIqqPTd3Nf73VFtooU1HcmdvONlqyox20_gGgcBddd3CRD2fQuuwkgYceq-FTPh5Mn1-wS3dxMQeMdYuLi5L-CMPWLtZA12RTPPCH2vPxbA89dC_vL65Iyb5ADAvFlBieWSop1C0FtxLyFimMoIF2-mSUmchKpVyCYahRkQtzaVtkRmUZF2lqAs32UWOUj-wBwrHSNHJBgXM3qiTXlqVhkElACYXG2yYKKrUmpoQmB4aMYVKDKns1JXAJakpmTXRWTynmuBy_CbeqtUpKF50kLu-kgNYnwyY6r9ZmMfzjzQ7_JH2E1vwJE9-92EKN6fjVHqNV8zYdTMYn3nLfARkL4_4 priority: 102 providerName: Springer Nature |
| Title | A polynomial time algorithm for production planning with bounded inventory |
| URI | https://link.springer.com/article/10.1007/s00170-007-1246-y https://www.proquest.com/docview/2262506491 |
| Volume | 39 |
| WOSCitedRecordID | wos000259961500014&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: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1433-3015 dateEnd: 20221231 omitProxy: false ssIdentifier: ssj0016168 issn: 0268-3768 databaseCode: M7S dateStart: 19970201 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1433-3015 dateEnd: 20221231 omitProxy: false ssIdentifier: ssj0016168 issn: 0268-3768 databaseCode: BENPR dateStart: 19970201 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVAVX databaseName: Springer LINK customDbUrl: eissn: 1433-3015 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0016168 issn: 0268-3768 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LTxsxEB4V6AEO0BZQw0s-9FRksWsb7_qEKCKqeoiiAFVuq_VjIVJItkmolH9fj-NNChJcuKxW8kNaz9gz65n5PoBvMkuE5rmmOXOaCmEl1XnJaJXZSlSGG5voQDaRdTp5v6-68cJtGtMqmzMxHNR2bPCO_My7CQzB1VR6Uf-hyBqF0dVIobEGG4iSwELq3k2jT6nKkBNzqW9MIRH9Sp-5OOeLKFeMOsg0lM7535IcN17eREGTADoaKFoQUpEJSefP7djKOX0RTw1mqr3z3g_8BNvRQSWXC436DB_c6Ats_QdbuAu_Lkk9Hs6xoNn3RHZ6Ug7v_Vyzh0finWBSL2BkvchJHUmRCF74Eo0kTs6SQUh1H0_me3DXvr69-kkjJwM1PJUzakTlmGIYzZTCKfRmlDSSJdovLWfcZE6VpXc7DDNl5o2fPZeVKatKSGtNovk-rI_GI_cVSF5qlnlTIYRvLZXQjts0qRRih2I5bguSZoULEwHLkTdjWCyhloNQCnxFoRTzFnxfDqkXaB1vdT5qBFHEjTstVlJowWkjylXzq5MdvD3ZIWyGRJNQxHgE67PJkzuGj-bvbDCdnMDGj-tOt3cStNc_eze__wFGFvCX |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NT9RAFH9BNBEO-ElYRJ2DXjQT2pnZaedgCAEJCG5MxIRb7XxUNll2y26V9J_ib2TetN1VE7lx8NZk2knb9zUz773fD-CNTCKheappypymQlhJdZozWiS2EIXhxkY6kE0kg0F6dqa-LMF11wuDZZWdTwyO2k4MnpFv-2UCQ3A1Fe-UlxRZozC72lFoNGpx7Oorv2WbfTja9_J9y9jBx9O9Q9qyClDDY1lRIwrHFMN8nBROYTxW0kgW6X6ccMZN4lSe-8BpmMkT775tXxYmLwohrTWR5n7ee3BfoPcPpYJfO_2NVYIcnHP9ZgqJ7xf2w0WfN1m1Nssh49Cq57dBKRp62mVdowByGihhEMKRCUnrP-PmYjH8V_42hMWDR__bD30Ma-0CnOw2FvMEltz4Kaz-Bsv4DD7tknIyqrFh299ZDS8cyUc__LtX5xfEL_JJ2cDkepUmZUv6RPBAm2gkqXKWDEMp_2RaP4dvd_Ix67A8nozdBpA01yzxoVAIP5oroR23cVQoxEbFduMeRJ1EM9MCsiMvyCibQ0kHJcjwEpUgq3vwbv5I2aCR3HbzVif4rHVMs2wh9R6871RnMfzPyTZvn-w1PDw8_XySnRwNjl_ASiiqCQ2bW7BcTX-6l_DA_KqGs-mrYDEEvt-1Rt0AsqlKIQ |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fT9swED5tDE3sYRswRDfG_MATyCKxXSd-RNuqbUwV0gDxFsW_oFLXRm2Y1P9-PidpYWJI094i2U6Uu7Pu7Lv7PoADmSVC81zTnDlNhbCS6rxk1GfWC2-4sYmOZBPZcJhfXamzlud03lW7dynJpqcBUZom9XFl_fGy8S3CvlC8Zgv-SdLFU3gmkDMIj-s_LjuDSlWGpJhLg2MKmehXBs1FnzdprjbtINPYOxfOJTnuvLxLgz70yfuObBWd_pFQjX5q8Oq___A1vGxDVHLS2NQmPHGTLXhxB7hwG76dkGo6XmBLc5iJ_PSkHF9PZ6P65icJYTCpGiDZoHRStbRIBK98iUYaJ2fJKBa7T2eLN3Ax-Hz-8QttWRmo4amsqRHeMcUwnymFUxjPKGkkS3SQLWfcZE6VZQg8DDNlFtyf7UtvSu-FtNYkmu_A2mQ6cbtA8lKzLDgLIcJoqYR23KaJV4geig25PUg6ERemhSxH5oxxsQRbjmIq8BHFVCx6cLhcUjV4HY9N3uv0VrRbd16EeJQhip9Ke3DU6Wk1_NeXvf2n2R_g-dmnQfH96_D0HWzEIpTY4LgHa_Xs1r2HdfOrHs1n-9GgfwMFXu_G |
| 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=A+polynomial+time+algorithm+for+production+planning+with+bounded+inventory&rft.jtitle=International+journal+of+advanced+manufacturing+technology&rft.au=Liu%2C+X&rft.date=2008-11-01&rft.pub=Springer+Nature+B.V&rft.issn=0268-3768&rft.eissn=1433-3015&rft.volume=39&rft.issue=7-8&rft.spage=774&rft.epage=782&rft_id=info:doi/10.1007%2Fs00170-007-1246-y |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0268-3768&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0268-3768&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0268-3768&client=summon |