Hybrid approach for buffer allocation in open serial production lines
The buffer allocation problem is an NP-hard combinatorial optimization problem involving the determination of the number of buffers in buffer locations required to increase the efficiency of a production line. Researchers in this field have proposed various optimization techniques to solve the probl...
Uloženo v:
| Vydáno v: | Computers & operations research Ročník 60; s. 67 - 78 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
Elsevier Ltd
01.08.2015
Pergamon Press Inc |
| Témata: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| 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 | The buffer allocation problem is an NP-hard combinatorial optimization problem involving the determination of the number of buffers in buffer locations required to increase the efficiency of a production line. Researchers in this field have proposed various optimization techniques to solve the problem for different types of production system configurations. In this study, a hybrid approach-based simulation optimization is proposed to determine the buffer sizes required in open serial production lines to maximize the average production rate of the system. This approach involves the use of a search tool and an evaluative tool. A hybrid approach using a genetic algorithm and simulated annealing is used as a search tool to create candidate buffer sizes. As an evaluative tool, discrete event simulation modeling is used to obtain the average production rate of the line. The performance of the proposed approach and the power of the hybridization are investigated for various serial line configurations. Promising results demonstrate the efficacy of the proposed hybrid approach for the buffer allocation problem in open serial lines. |
|---|---|
| AbstractList | The buffer allocation problem is an NP-hard combinatorial optimization problem involving the determination of the number of buffers in buffer locations required to increase the efficiency of a production line. Researchers in this field have proposed various optimization techniques to solve the problem for different types of production system configurations. In this study, a hybrid approach-based simulation optimization is proposed to determine the buffer sizes required in open serial production lines to maximize the average production rate of the system. This approach involves the use of a search tool and an evaluative tool. A hybrid approach using a genetic algorithm and simulated annealing is used as a search tool to create candidate buffer sizes. As an evaluative tool, discrete event simulation modeling is used to obtain the average production rate of the line. The performance of the proposed approach and the power of the hybridization are investigated for various serial line configurations. Promising results demonstrate the efficacy of the proposed hybrid approach for the buffer allocation problem in open serial lines. |
| Author | Kose, Simge Yelkenci Kilincci, Ozcan |
| Author_xml | – sequence: 1 givenname: Simge Yelkenci surname: Kose fullname: Kose, Simge Yelkenci email: simge.yelkenci@deu.edu.tr organization: Ministry of Science, Industry and Technology, Directorate General for Safety and Inspection of Industrial Product, 06510 Ankara, Turkey – sequence: 2 givenname: Ozcan surname: Kilincci fullname: Kilincci, Ozcan organization: Dokuz Eylul University, Department of Industrial Engineering, 35160 Izmir, Turkey |
| BookMark | eNp9kE1LxDAQhoMouH78AG8FL15aZ7bbJMWTiLrCghcFbyFNJ5ilJmvSCv57s7uePDgMzCHPO0yeE3bogyfGLhAqBOTX68qEWM0BmwqwAmgP2AylqEvBm7dDNoMamhKahTxmJymtIZeY44zdL7-76PpCbzYxaPNe2BCLbrKWYqGHIRg9uuAL54uwIV8kik4PRWb7yexeBucpnbEjq4dE57_zlL0-3L_cLcvV8-PT3e2qNLVsx1JK0xA2QkDfCJQdb20nDG9b6IC4BUCSbe6F7SxIyG1kHhzmXPdt3dSn7Gq_Nx_wOVEa1YdLhoZBewpTUigAYYGyxYxe_kHXYYo-X6eQ569zycWWwj1lYkgpklWb6D50_FYIaitWrVUWq7ZiFaDKYnNG_MkYN-40jVG74d_kzT5J2dGXo6iSceQN9S6SGVUf3D_pH6FOkw4 |
| CODEN | CMORAP |
| CitedBy_id | crossref_primary_10_1108_RIA_10_2024_0236 crossref_primary_10_1134_S207004821803002X crossref_primary_10_1177_09544054231221963 crossref_primary_10_1016_j_cie_2022_108871 crossref_primary_10_1080_24725854_2018_1442031 crossref_primary_10_1016_j_cie_2025_110918 crossref_primary_10_1080_00207543_2019_1685709 crossref_primary_10_1109_ACCESS_2023_3307017 crossref_primary_10_1007_s40436_023_00461_1 crossref_primary_10_1007_s00170_015_7995_0 crossref_primary_10_1080_00207543_2021_1909169 crossref_primary_10_1016_j_ejor_2019_11_013 crossref_primary_10_17533_udea_redin_20210735 crossref_primary_10_1016_j_eswa_2021_114631 crossref_primary_10_1007_s10845_018_1435_6 crossref_primary_10_1007_s12597_019_00362_7 crossref_primary_10_1016_j_ifacol_2021_08_067 crossref_primary_10_1016_j_cor_2019_104835 crossref_primary_10_1016_j_jmsy_2021_06_013 crossref_primary_10_1016_j_cie_2025_111002 crossref_primary_10_1109_ACCESS_2022_3181134 crossref_primary_10_1016_j_cie_2025_111349 crossref_primary_10_1002_qre_2578 crossref_primary_10_1007_s00170_022_09867_w crossref_primary_10_1007_s13762_018_1742_7 crossref_primary_10_1016_j_jer_2025_03_008 crossref_primary_10_1111_exsy_12455 crossref_primary_10_1080_24725854_2017_1328751 crossref_primary_10_1007_s00291_020_00603_y crossref_primary_10_1016_j_eswa_2019_112836 crossref_primary_10_1016_j_jclepro_2017_08_064 crossref_primary_10_1007_s11740_018_0801_8 crossref_primary_10_1007_s11740_025_01345_y crossref_primary_10_1016_j_jbi_2017_08_004 |
| Cites_doi | 10.1080/00207540110056144 10.1080/07408179108963854 10.1080/00207540110091703 10.1023/A:1018988226612 10.1016/S0360-8352(01)00051-1 10.1080/0305215X.2013.875166 10.1016/S0305-0548(99)00137-9 10.1016/j.cor.2013.02.004 10.1023/A:1016560109076 10.1080/00207540210161641 10.1108/13552510510601348 10.1155/2012/692593 10.1080/07408170008963874 10.1007/s10845-007-0030-z 10.1126/science.220.4598.671 10.1016/j.engappai.2004.02.008 10.1016/j.ijpe.2006.02.011 10.1080/00207540500465535 10.1007/BF01158636 10.1080/00207540801910429 10.1080/00207540801939022 10.1007/s001700200090 10.1016/S0305-0548(98)00034-3 10.1016/j.ijpe.2012.02.011 10.1080/07408170590916878 10.1016/j.engappai.2008.10.005 10.1080/0305215X.2010.481022 10.1016/0360-8352(94)00188-S 10.1080/00207547908919637 10.1023/A:1018984125703 10.1080/07408179608966249 10.1287/opre.35.2.291 10.1016/j.cor.2005.11.016 10.1080/07408179908969834 10.1016/j.ijpe.2010.02.017 10.1155/S1024123X99001180 10.1080/002075400189284 10.1155/S1024123X04402014 10.1016/S0377-2217(97)00276-2 10.1080/00207540600564625 10.1016/0377-2217(95)00378-9 10.1016/j.cor.2011.05.004 10.1016/j.cie.2011.03.012 10.1080/07408170304431 10.1016/j.ijpe.2009.06.040 10.1016/j.cor.2011.08.019 10.1007/s10845-012-0687-9 10.1080/07408170500208289 10.1080/00207549108948066 10.1016/S0305-0548(00)00060-5 10.1007/s00170-011-3802-8 10.1287/mnsc.25.8.721 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier Ltd Copyright Pergamon Press Inc. Aug 2015 |
| Copyright_xml | – notice: 2015 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Aug 2015 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2015.01.009 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X 0305-0548 |
| EndPage | 78 |
| ExternalDocumentID | 3650871691 10_1016_j_cor_2015_01_009 S0305054815000222 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c389t-88c5e15770d5718b69fb7c6990b0e6f001e89e894fbf080080c88006026ad9353 |
| ISICitedReferencesCount | 44 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000353730600006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Sat Sep 27 22:50:44 EDT 2025 Sun Nov 09 07:28:27 EST 2025 Sat Nov 29 03:23:38 EST 2025 Tue Nov 18 22:34:36 EST 2025 Fri Feb 23 02:33:28 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Hybrid meta-heuristics Production lines Combinatorial optimization Buffer allocation problem |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c389t-88c5e15770d5718b69fb7c6990b0e6f001e89e894fbf080080c88006026ad9353 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1672168671 |
| PQPubID | 45870 |
| PageCount | 12 |
| ParticipantIDs | proquest_miscellaneous_1701041891 proquest_journals_1672168671 crossref_primary_10_1016_j_cor_2015_01_009 crossref_citationtrail_10_1016_j_cor_2015_01_009 elsevier_sciencedirect_doi_10_1016_j_cor_2015_01_009 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-08-01 |
| PublicationDateYYYYMMDD | 2015-08-01 |
| PublicationDate_xml | – month: 08 year: 2015 text: 2015-08-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2015 |
| Publisher | Elsevier Ltd Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc |
| References | Enginarlar, Li, Meerkov, Zhang (bib16) 2002; 40 Hillier (bib13) 2000; 32 Nahas, Ait-Kadi, Nourelfath (bib39) 2006; 103 Powell, Pyke (bib12) 1996; 2 Kose, Demir, Tunali, Eliiyi (bib27) 2015; 47 Spinellis, Papadopoulos (bib35) 2000; 93 Enginarlar, Li, Meerkov (bib17) 2005; 37 Demir, Tunali, Eliiyi, Løkketangen (bib42) 2013; 40 Tempelmeier (bib37) 2003; 41 Demir, Tunali, Eliiyi (bib5) 2014; 25 Diamantidis, Papadopoulos (bib30) 2004; 3 Hillier, So (bib9) 1991; 23 Bulgak, Diwan, Inozu (bib55) 1995; 28 Spinellis, Papadopoulos, Smith (bib31) 2000; 38 Sabuncuoglu, Erel, Gocgun (bib23) 2006; 44 Papadopoulos, Vidalis (bib14) 2001; 41 Harris, Powell (bib6) 1999; 31 Conway, Maxwell, McClain, Thomas (bib8) 1988; 8 Can, Heavey (bib26) 2012; 39 Hillier, Boling (bib63) 1966; 17 Nourelfath, Nahas, Ait-Kadi (bib38) 2005; 11 Freeman (bib7) 1964; 15 Gershwin, Schor (bib2) 2000; 93 Nearchou (bib48) 2004; 17 Shi, Men (bib45) 2003; 35 Powell (bib11) 1994; 32 Gershwin (bib33) 1987; 35 Demir, Tunali, Eliiyi (bib41) 2012; 39 Papadopoulos, Heavey (bib4) 1996; 92 Demir, Tunali, Løkketangen (bib1) 2011; 43 Chaharsooghi, Nahavandi (bib32) 2003; 10 Vouros, Papadopoulos (bib53) 1998; 25 Ho, Eyler, Chien (bib62) 1979; 17 Cruz, Van Woensel, Smith (bib57) 2010; 125 Shi, Gershwin (bib40) 2009; 122 Shi C, Gershwin SB. The segmentation method for long line optimization. In: Presented at the SMMSO 2011, 8th international conference on stochastic models of manufacturing and service operations, Kusadasi, Turkey; 28th May–2nd June, 2011, Conference Proceedings; 2011. p. 128–35. Helber (bib36) 2001; 39 Goldberg (bib60) 1989 Hillier, Boling (bib65) 1979; 25 Liu C, Tu FS. Buffer allocation via the genetic algorithm. In: Proceedings of the 33rd conference on decision and control. USA, Florida; 1994. p. 609–10. Hillier FS, Boling RW. Toward characterizing the optimal allocation of work in production line systems with variable operation times. In: Roubens M. editor, Advances in operations research, proc Euro, II. North Holland: Amsterdam; 1977. Spinellis, Papadopoulos (bib20) 2000; 5 Can, Heavey (bib25) 2011; 61 Dolgui, Eremeev, Kolokolov, Sigaev (bib28) 2002; 1 Dolgui, Eremeev, Sigaev (bib29) 2007; 18 Hillier, Hillier (bib18) 2006; 38 Staley, Kim (bib19) 2012; 137 Lutz, Davis, Sun (bib22) 1998; 106 Vergara, Kim (bib24) 2009; 47 Chan, Ng (bib15) 2002; 19 Oysu, Bingul (bib51) 2009; 22 Amiri, Mohtashami (bib46) 2011; 62 Cruz, Kendall, While, Duarte, Brito (bib58) 2012 Wang, Zheng (bib47) 2001; 28 Huang, Chang, Chou (bib44) 2002; 29 Gershwin (bib52) 1994 Seong, Chang, Hong (bib34) 2000; 17 Bulgak (bib56) 2006; 44 Yoo, Gen (bib49) 2007; 34 Gen, Cheng (bib54) 1997 Hillier, So (bib10) 1991; 29 Dallery, Gershwin (bib3) 1992; 12 Papadopoulos, O׳Kelly, Vidalis, Spinellis (bib21) 2009 Yogeswaran, Ponnambalam, Tiwari (bib50) 2009; 47 Kirkpatrick, Gelatt, Veechi (bib59) 1983; 220 Cruz (10.1016/j.cor.2015.01.009_bib58) 2012 Powell (10.1016/j.cor.2015.01.009_bib11) 1994; 32 Dolgui (10.1016/j.cor.2015.01.009_bib29) 2007; 18 Vergara (10.1016/j.cor.2015.01.009_bib24) 2009; 47 Seong (10.1016/j.cor.2015.01.009_bib34) 2000; 17 Can (10.1016/j.cor.2015.01.009_bib26) 2012; 39 Papadopoulos (10.1016/j.cor.2015.01.009_bib14) 2001; 41 10.1016/j.cor.2015.01.009_bib61 Chaharsooghi (10.1016/j.cor.2015.01.009_bib32) 2003; 10 10.1016/j.cor.2015.01.009_bib64 Freeman (10.1016/j.cor.2015.01.009_bib7) 1964; 15 Chan (10.1016/j.cor.2015.01.009_bib15) 2002; 19 Hillier (10.1016/j.cor.2015.01.009_bib18) 2006; 38 Helber (10.1016/j.cor.2015.01.009_bib36) 2001; 39 Harris (10.1016/j.cor.2015.01.009_bib6) 1999; 31 Vouros (10.1016/j.cor.2015.01.009_bib53) 1998; 25 Yogeswaran (10.1016/j.cor.2015.01.009_bib50) 2009; 47 Amiri (10.1016/j.cor.2015.01.009_bib46) 2011; 62 Hillier (10.1016/j.cor.2015.01.009_bib63) 1966; 17 Huang (10.1016/j.cor.2015.01.009_bib44) 2002; 29 Enginarlar (10.1016/j.cor.2015.01.009_bib17) 2005; 37 Diamantidis (10.1016/j.cor.2015.01.009_bib30) 2004; 3 Nearchou (10.1016/j.cor.2015.01.009_bib48) 2004; 17 Hillier (10.1016/j.cor.2015.01.009_bib13) 2000; 32 Oysu (10.1016/j.cor.2015.01.009_bib51) 2009; 22 Staley (10.1016/j.cor.2015.01.009_bib19) 2012; 137 Kirkpatrick (10.1016/j.cor.2015.01.009_bib59) 1983; 220 Dolgui (10.1016/j.cor.2015.01.009_bib28) 2002; 1 Hillier (10.1016/j.cor.2015.01.009_bib65) 1979; 25 Spinellis (10.1016/j.cor.2015.01.009_bib35) 2000; 93 Spinellis (10.1016/j.cor.2015.01.009_bib20) 2000; 5 Kose (10.1016/j.cor.2015.01.009_bib27) 2015; 47 Demir (10.1016/j.cor.2015.01.009_bib1) 2011; 43 Bulgak (10.1016/j.cor.2015.01.009_bib55) 1995; 28 Bulgak (10.1016/j.cor.2015.01.009_bib56) 2006; 44 Enginarlar (10.1016/j.cor.2015.01.009_bib16) 2002; 40 Sabuncuoglu (10.1016/j.cor.2015.01.009_bib23) 2006; 44 Gershwin (10.1016/j.cor.2015.01.009_bib2) 2000; 93 Demir (10.1016/j.cor.2015.01.009_bib5) 2014; 25 Powell (10.1016/j.cor.2015.01.009_bib12) 1996; 2 Nahas (10.1016/j.cor.2015.01.009_bib39) 2006; 103 Papadopoulos (10.1016/j.cor.2015.01.009_bib21) 2009 Gershwin (10.1016/j.cor.2015.01.009_bib52) 1994 Wang (10.1016/j.cor.2015.01.009_bib47) 2001; 28 Cruz (10.1016/j.cor.2015.01.009_bib57) 2010; 125 Lutz (10.1016/j.cor.2015.01.009_bib22) 1998; 106 Papadopoulos (10.1016/j.cor.2015.01.009_bib4) 1996; 92 Hillier (10.1016/j.cor.2015.01.009_bib9) 1991; 23 Tempelmeier (10.1016/j.cor.2015.01.009_bib37) 2003; 41 Gen (10.1016/j.cor.2015.01.009_bib54) 1997 10.1016/j.cor.2015.01.009_bib43 Hillier (10.1016/j.cor.2015.01.009_bib10) 1991; 29 Demir (10.1016/j.cor.2015.01.009_bib41) 2012; 39 Ho (10.1016/j.cor.2015.01.009_bib62) 1979; 17 Dallery (10.1016/j.cor.2015.01.009_bib3) 1992; 12 Demir (10.1016/j.cor.2015.01.009_bib42) 2013; 40 Gershwin (10.1016/j.cor.2015.01.009_bib33) 1987; 35 Goldberg (10.1016/j.cor.2015.01.009_bib60) 1989 Spinellis (10.1016/j.cor.2015.01.009_bib31) 2000; 38 Shi (10.1016/j.cor.2015.01.009_bib45) 2003; 35 Can (10.1016/j.cor.2015.01.009_bib25) 2011; 61 Nourelfath (10.1016/j.cor.2015.01.009_bib38) 2005; 11 Conway (10.1016/j.cor.2015.01.009_bib8) 1988; 8 Yoo (10.1016/j.cor.2015.01.009_bib49) 2007; 34 Shi (10.1016/j.cor.2015.01.009_bib40) 2009; 122 |
| References_xml | – volume: 31 start-page: 287 year: 1999 end-page: 302 ident: bib6 article-title: An algorithm for optimal buffer placement in reliable serial lines publication-title: IIE Trans – volume: 29 start-page: 2043 year: 1991 end-page: 2055 ident: bib10 article-title: The effect of machine breakdowns and interstage storage on production line systems publication-title: Int J Prod Res – volume: 44 start-page: 4067 year: 2006 end-page: 4080 ident: bib56 article-title: Analysis and design of split and merge unpaced assembly systems by metamodelling and stochastic search publication-title: Int J Prod Res – volume: 137 start-page: 284 year: 2012 end-page: 291 ident: bib19 article-title: Experimental results for the allocation of buffers in closed serial production lines publication-title: Int J Prod Econ – volume: 22 start-page: 389 year: 2009 end-page: 396 ident: bib51 article-title: Application of heuristic and hybrid-GASA algorithms to tool-path optimization problem for minimizing air time during machining publication-title: Eng Appl Artif Intell – year: 1997 ident: bib54 article-title: Genetic algorithms and engineering design – year: 2012 ident: bib58 article-title: Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers publication-title: Math Probl Eng – reference: Liu C, Tu FS. Buffer allocation via the genetic algorithm. In: Proceedings of the 33rd conference on decision and control. USA, Florida; 1994. p. 609–10. – volume: 220 start-page: 671 year: 1983 end-page: 680 ident: bib59 article-title: Optimization by simulated annealing publication-title: Science – volume: 43 start-page: 213 year: 2011 end-page: 231 ident: bib1 article-title: A tabu search approach for buffer allocation in production lines with unreliable machines publication-title: Eng Optim – volume: 38 start-page: 39 year: 2006 end-page: 51 ident: bib18 article-title: Simultaneous optimization of work and buffer space in unpaced production lines with random processing times publication-title: IIE Trans – volume: 34 start-page: 3084 year: 2007 end-page: 3098 ident: bib49 article-title: Scheduling algorithm for real-time tasks using multi objective hybrid genetic algorithm in heterogeneous multiprocessors system publication-title: Comput Oper Res – volume: 61 start-page: 447 year: 2011 end-page: 462 ident: bib25 article-title: Comparison of experimental designs for simulation-based symbolic regression of manufacturing systems publication-title: Comput Ind Eng – volume: 35 start-page: 1 year: 2003 end-page: 10 ident: bib45 article-title: Optimal buffer allocation in production lines publication-title: IIE Trans – volume: 62 start-page: 371 year: 2011 end-page: 383 ident: bib46 article-title: Buffer allocation in unreliable production lines based on design of experiments, simulation, and genetic algorithm publication-title: Int J Adv Manuf – volume: 1 start-page: 89 year: 2002 end-page: 104 ident: bib28 article-title: A genetic algorithm for the allocation of buffer storage capacities in a production line with unreliable machines publication-title: J Math Model Algorithms – volume: 38 start-page: 509 year: 2000 end-page: 541 ident: bib31 article-title: Large production line optimization using simulated annealing publication-title: Int J Prod Res – volume: 25 start-page: 371 year: 2014 end-page: 392 ident: bib5 article-title: The state of the art on buffer allocation problem: a comprehensive survey publication-title: J Intell Manuf – volume: 11 start-page: 121 year: 2005 end-page: 138 ident: bib38 article-title: Optimal design of series production lines with unreliable machines and finite buffers publication-title: J Qual Maint Eng – volume: 40 start-page: 601 year: 2002 end-page: 624 ident: bib16 article-title: Buffer capacity for accommodating machine downtime in serial production lines publication-title: Int J Prod Res – year: 1994 ident: bib52 article-title: Manufacturing systems engineering – volume: 93 start-page: 117 year: 2000 end-page: 144 ident: bib2 article-title: Efficient algorithms for buffer space allocation publication-title: Ann Oper Res – volume: 17 start-page: 169 year: 2000 end-page: 180 ident: bib34 article-title: An algorithm for buffer allocation with linear resource constraints in a continuous-flow unreliable production line publication-title: Asia-Pac J Oper Res – volume: 28 start-page: 309 year: 1995 end-page: 322 ident: bib55 article-title: Buffer size optimization in asynchronous assembly systems using genetic algorithms publication-title: Comput Ind Eng – volume: 12 start-page: 3 year: 1992 end-page: 94 ident: bib3 article-title: Manufacturing flow line systems: a review of models and analytical results publication-title: Queuing Syst – volume: 3 start-page: 209 year: 2004 end-page: 223 ident: bib30 article-title: A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines publication-title: Math Probl Eng – year: 1989 ident: bib60 article-title: Genetic algorithms in search, optimization and machine learning – volume: 92 start-page: 1 year: 1996 end-page: 27 ident: bib4 article-title: Queuing theory in manufacturing systems analysis and design: a classification of models for production and transfer lines publication-title: Eur J Oper Res – volume: 2 start-page: 18 year: 1996 end-page: 29 ident: bib12 article-title: Allocation of buffers to serial production lines with bottlenecks publication-title: IIE Trans – volume: 47 start-page: 4437 year: 2009 end-page: 4456 ident: bib24 article-title: A new method for the placement of buffers in serial production lines publication-title: Int J Prod Res – volume: 28 start-page: 585 year: 2001 end-page: 596 ident: bib47 article-title: An effective hybrid optimisation strategy for job-shop scheduling problems publication-title: Comput Oper Res – volume: 19 start-page: 789 year: 2002 end-page: 800 ident: bib15 article-title: Comparative evaluations of buffer allocation strategies in a serial production line publication-title: Int J Adv Manuf Technol – volume: 47 start-page: 149 year: 2015 end-page: 164 ident: bib27 article-title: Capacity improvement using simulation optimization approaches: a case study in the thermo-technology industry publication-title: Eng Optim – volume: 5 start-page: 441 year: 2000 end-page: 458 ident: bib20 article-title: Stochastic algorithms for buffer allocation in reliable production lines publication-title: Math Probl Eng – volume: 25 start-page: 1055 year: 1998 end-page: 1067 ident: bib53 article-title: Buffer allocation in unreliable production lines using a knowledge based system publication-title: Comput Oper Res – volume: 106 start-page: 301 year: 1998 end-page: 316 ident: bib22 article-title: Determining buffer location and size in production lines using tabu search publication-title: Eur J Oper Res – volume: 41 start-page: 261 year: 2001 end-page: 277 ident: bib14 article-title: A heuristic algorithm for the buffer allocation in unreliable unbalanced production lines publication-title: Comput Ind Eng – volume: 17 start-page: 289 year: 2004 end-page: 300 ident: bib48 article-title: A novel metaheuristic approach for the flow shop scheduling problem publication-title: Eng Appl Artif Intell – volume: 10 start-page: 401 year: 2003 end-page: 409 ident: bib32 article-title: Buffer allocation problem, a heuristic approach publication-title: Sci Iran – volume: 39 start-page: 3061 year: 2001 end-page: 3083 ident: bib36 article-title: Cash-flow-oriented buffer allocation in stochastic flow lines publication-title: Int J Prod Res – volume: 17 start-page: 651 year: 1966 end-page: 658 ident: bib63 article-title: The effect of some design factors on the efficiency of production lines with variable operation times publication-title: J Ind Eng – volume: 40 start-page: 2556 year: 2013 end-page: 2563 ident: bib42 article-title: Two approaches for solving the buffer allocation problem in unreliable production lines publication-title: Comput Oper Res – volume: 125 start-page: 224 year: 2010 end-page: 234 ident: bib57 article-title: Buffer and throughput trade-offs in M/G/1/K queuing networks: a bicriteria approach publication-title: Int J Prod Econ – reference: Shi C, Gershwin SB. The segmentation method for long line optimization. In: Presented at the SMMSO 2011, 8th international conference on stochastic models of manufacturing and service operations, Kusadasi, Turkey; 28th May–2nd June, 2011, Conference Proceedings; 2011. p. 128–35. – volume: 37 start-page: 333 year: 2005 end-page: 342 ident: bib17 article-title: How lean can lean buffers be? publication-title: IIE Trans – year: 2009 ident: bib21 article-title: Analysis and Design of Discrete Part Production Lines – volume: 18 start-page: 411 year: 2007 end-page: 420 ident: bib29 article-title: HBBA: hybrid algorithm for buffer allocation in tandem production lines publication-title: J Intell Manuf – volume: 32 start-page: 2201 year: 1994 end-page: 2217 ident: bib11 article-title: Buffer allocation in unbalanced three-station serial lines publication-title: Int J Prod Res – volume: 47 start-page: 5421 year: 2009 end-page: 5448 ident: bib50 article-title: An efficient hybrid evolutionary heuristic using genetic algorithm and simulated annealing algorithm to solve machine loading problem in FMS publication-title: Int J Prod Res – volume: 23 start-page: 198 year: 1991 end-page: 206 ident: bib9 article-title: The effect of the coeffcient of variation of operation times on the allocation of storage space in production line systems publication-title: IIE Trans – volume: 41 start-page: 149 year: 2003 end-page: 170 ident: bib37 article-title: Practical considerations in the optimization of flow production systems publication-title: Int J Prod Res – volume: 39 start-page: 424 year: 2012 end-page: 436 ident: bib26 article-title: A comparison of genetic programming and artificial neural networks in metamodeling of discrete-event simulation models publication-title: Comput Oper Res – reference: Hillier FS, Boling RW. Toward characterizing the optimal allocation of work in production line systems with variable operation times. In: Roubens M. editor, Advances in operations research, proc Euro, II. North Holland: Amsterdam; 1977. – volume: 39 start-page: 1477 year: 2012 end-page: 1486 ident: bib41 article-title: An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines publication-title: Comput Oper Res – volume: 17 start-page: 557 year: 1979 end-page: 580 ident: bib62 article-title: A gradient technique for general buffer storage design in a production line publication-title: Int J Prod Res – volume: 93 start-page: 373 year: 2000 end-page: 384 ident: bib35 article-title: A simulated annealing approach for buffer allocation in reliable production lines publication-title: Ann Oper Res – volume: 8 start-page: 1183 year: 1988 end-page: 1196 ident: bib8 article-title: The role of work-in-process inventories in serial production lines publication-title: Oper Res – volume: 32 start-page: 1 year: 2000 end-page: 8 ident: bib13 article-title: Characterizing the optimal allocation of storage space in production line systems with variable processing times publication-title: IIE Trans – volume: 15 start-page: 194 year: 1964 end-page: 200 ident: bib7 article-title: The effects of breakdowns and interstage storage on production line capacity publication-title: J Ind Eng – volume: 44 start-page: 2499 year: 2006 end-page: 2523 ident: bib23 article-title: Analysis of serial production lines: characterization study and a new heuristic procedure for optimal buffer allocation publication-title: Int J Prod Res – volume: 35 start-page: 291 year: 1987 end-page: 305 ident: bib33 article-title: An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking publication-title: Oper Res – volume: 122 start-page: 725 year: 2009 end-page: 740 ident: bib40 article-title: An efficient buffer design algorithm for production line profit maximization publication-title: Int J Prod Econ – volume: 103 start-page: 873 year: 2006 end-page: 881 ident: bib39 article-title: A new approach for buffer allocation in unreliable production lines publication-title: Int J Prod Econ – volume: 29 start-page: 103 year: 2002 end-page: 121 ident: bib44 article-title: Buffer allocation in flow-shop-type production systems with general arrival and service patterns publication-title: Comput Oper Res – volume: 25 start-page: 721 year: 1979 end-page: 728 ident: bib65 article-title: On the optimal allocation of work in symmetrically unbalanced production line systems with variable operation times publication-title: Manag. Sci – volume: 39 start-page: 3061 issue: 14 year: 2001 ident: 10.1016/j.cor.2015.01.009_bib36 article-title: Cash-flow-oriented buffer allocation in stochastic flow lines publication-title: Int J Prod Res doi: 10.1080/00207540110056144 – volume: 23 start-page: 198 year: 1991 ident: 10.1016/j.cor.2015.01.009_bib9 article-title: The effect of the coeffcient of variation of operation times on the allocation of storage space in production line systems publication-title: IIE Trans doi: 10.1080/07408179108963854 – volume: 40 start-page: 601 year: 2002 ident: 10.1016/j.cor.2015.01.009_bib16 article-title: Buffer capacity for accommodating machine downtime in serial production lines publication-title: Int J Prod Res doi: 10.1080/00207540110091703 – volume: 93 start-page: 117 year: 2000 ident: 10.1016/j.cor.2015.01.009_bib2 article-title: Efficient algorithms for buffer space allocation publication-title: Ann Oper Res doi: 10.1023/A:1018988226612 – year: 1994 ident: 10.1016/j.cor.2015.01.009_bib52 – volume: 41 start-page: 261 year: 2001 ident: 10.1016/j.cor.2015.01.009_bib14 article-title: A heuristic algorithm for the buffer allocation in unreliable unbalanced production lines publication-title: Comput Ind Eng doi: 10.1016/S0360-8352(01)00051-1 – year: 1997 ident: 10.1016/j.cor.2015.01.009_bib54 – volume: 47 start-page: 149 issue: 2 year: 2015 ident: 10.1016/j.cor.2015.01.009_bib27 article-title: Capacity improvement using simulation optimization approaches: a case study in the thermo-technology industry publication-title: Eng Optim doi: 10.1080/0305215X.2013.875166 – volume: 28 start-page: 585 year: 2001 ident: 10.1016/j.cor.2015.01.009_bib47 article-title: An effective hybrid optimisation strategy for job-shop scheduling problems publication-title: Comput Oper Res doi: 10.1016/S0305-0548(99)00137-9 – volume: 40 start-page: 2556 issue: 10 year: 2013 ident: 10.1016/j.cor.2015.01.009_bib42 article-title: Two approaches for solving the buffer allocation problem in unreliable production lines publication-title: Comput Oper Res doi: 10.1016/j.cor.2013.02.004 – volume: 1 start-page: 89 year: 2002 ident: 10.1016/j.cor.2015.01.009_bib28 article-title: A genetic algorithm for the allocation of buffer storage capacities in a production line with unreliable machines publication-title: J Math Model Algorithms doi: 10.1023/A:1016560109076 – volume: 41 start-page: 149 issue: 1 year: 2003 ident: 10.1016/j.cor.2015.01.009_bib37 article-title: Practical considerations in the optimization of flow production systems publication-title: Int J Prod Res doi: 10.1080/00207540210161641 – ident: 10.1016/j.cor.2015.01.009_bib43 – volume: 11 start-page: 121 issue: 2 year: 2005 ident: 10.1016/j.cor.2015.01.009_bib38 article-title: Optimal design of series production lines with unreliable machines and finite buffers publication-title: J Qual Maint Eng doi: 10.1108/13552510510601348 – year: 2012 ident: 10.1016/j.cor.2015.01.009_bib58 article-title: Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers publication-title: Math Probl Eng doi: 10.1155/2012/692593 – volume: 32 start-page: 1 year: 2000 ident: 10.1016/j.cor.2015.01.009_bib13 article-title: Characterizing the optimal allocation of storage space in production line systems with variable processing times publication-title: IIE Trans doi: 10.1080/07408170008963874 – volume: 18 start-page: 411 year: 2007 ident: 10.1016/j.cor.2015.01.009_bib29 article-title: HBBA: hybrid algorithm for buffer allocation in tandem production lines publication-title: J Intell Manuf doi: 10.1007/s10845-007-0030-z – volume: 220 start-page: 671 year: 1983 ident: 10.1016/j.cor.2015.01.009_bib59 article-title: Optimization by simulated annealing publication-title: Science doi: 10.1126/science.220.4598.671 – volume: 17 start-page: 289 year: 2004 ident: 10.1016/j.cor.2015.01.009_bib48 article-title: A novel metaheuristic approach for the flow shop scheduling problem publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2004.02.008 – volume: 103 start-page: 873 year: 2006 ident: 10.1016/j.cor.2015.01.009_bib39 article-title: A new approach for buffer allocation in unreliable production lines publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2006.02.011 – volume: 44 start-page: 2499 issue: 13 year: 2006 ident: 10.1016/j.cor.2015.01.009_bib23 article-title: Analysis of serial production lines: characterization study and a new heuristic procedure for optimal buffer allocation publication-title: Int J Prod Res doi: 10.1080/00207540500465535 – volume: 12 start-page: 3 issue: 1–2 year: 1992 ident: 10.1016/j.cor.2015.01.009_bib3 article-title: Manufacturing flow line systems: a review of models and analytical results publication-title: Queuing Syst doi: 10.1007/BF01158636 – volume: 47 start-page: 5421 issue: 19 year: 2009 ident: 10.1016/j.cor.2015.01.009_bib50 article-title: An efficient hybrid evolutionary heuristic using genetic algorithm and simulated annealing algorithm to solve machine loading problem in FMS publication-title: Int J Prod Res doi: 10.1080/00207540801910429 – volume: 47 start-page: 4437 issue: 16 year: 2009 ident: 10.1016/j.cor.2015.01.009_bib24 article-title: A new method for the placement of buffers in serial production lines publication-title: Int J Prod Res doi: 10.1080/00207540801939022 – volume: 10 start-page: 401 issue: 4 year: 2003 ident: 10.1016/j.cor.2015.01.009_bib32 article-title: Buffer allocation problem, a heuristic approach publication-title: Sci Iran – volume: 19 start-page: 789 year: 2002 ident: 10.1016/j.cor.2015.01.009_bib15 article-title: Comparative evaluations of buffer allocation strategies in a serial production line publication-title: Int J Adv Manuf Technol doi: 10.1007/s001700200090 – volume: 25 start-page: 1055 issue: 12 year: 1998 ident: 10.1016/j.cor.2015.01.009_bib53 article-title: Buffer allocation in unreliable production lines using a knowledge based system publication-title: Comput Oper Res doi: 10.1016/S0305-0548(98)00034-3 – volume: 137 start-page: 284 year: 2012 ident: 10.1016/j.cor.2015.01.009_bib19 article-title: Experimental results for the allocation of buffers in closed serial production lines publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2012.02.011 – volume: 37 start-page: 333 year: 2005 ident: 10.1016/j.cor.2015.01.009_bib17 article-title: How lean can lean buffers be? publication-title: IIE Trans doi: 10.1080/07408170590916878 – year: 1989 ident: 10.1016/j.cor.2015.01.009_bib60 – volume: 22 start-page: 389 year: 2009 ident: 10.1016/j.cor.2015.01.009_bib51 article-title: Application of heuristic and hybrid-GASA algorithms to tool-path optimization problem for minimizing air time during machining publication-title: Eng Appl Artif Intell doi: 10.1016/j.engappai.2008.10.005 – volume: 43 start-page: 213 issue: 2 year: 2011 ident: 10.1016/j.cor.2015.01.009_bib1 article-title: A tabu search approach for buffer allocation in production lines with unreliable machines publication-title: Eng Optim doi: 10.1080/0305215X.2010.481022 – volume: 28 start-page: 309 issue: 2 year: 1995 ident: 10.1016/j.cor.2015.01.009_bib55 article-title: Buffer size optimization in asynchronous assembly systems using genetic algorithms publication-title: Comput Ind Eng doi: 10.1016/0360-8352(94)00188-S – volume: 32 start-page: 2201 year: 1994 ident: 10.1016/j.cor.2015.01.009_bib11 article-title: Buffer allocation in unbalanced three-station serial lines publication-title: Int J Prod Res – year: 2009 ident: 10.1016/j.cor.2015.01.009_bib21 – volume: 17 start-page: 557 issue: 2 year: 1979 ident: 10.1016/j.cor.2015.01.009_bib62 article-title: A gradient technique for general buffer storage design in a production line publication-title: Int J Prod Res doi: 10.1080/00207547908919637 – volume: 8 start-page: 1183 year: 1988 ident: 10.1016/j.cor.2015.01.009_bib8 article-title: The role of work-in-process inventories in serial production lines publication-title: Oper Res – volume: 93 start-page: 373 year: 2000 ident: 10.1016/j.cor.2015.01.009_bib35 article-title: A simulated annealing approach for buffer allocation in reliable production lines publication-title: Ann Oper Res doi: 10.1023/A:1018984125703 – ident: 10.1016/j.cor.2015.01.009_bib64 – volume: 2 start-page: 18 year: 1996 ident: 10.1016/j.cor.2015.01.009_bib12 article-title: Allocation of buffers to serial production lines with bottlenecks publication-title: IIE Trans doi: 10.1080/07408179608966249 – volume: 35 start-page: 291 issue: 2 year: 1987 ident: 10.1016/j.cor.2015.01.009_bib33 article-title: An efficient decomposition method for the approximate evaluation of tandem queues with finite storage space and blocking publication-title: Oper Res doi: 10.1287/opre.35.2.291 – volume: 17 start-page: 169 year: 2000 ident: 10.1016/j.cor.2015.01.009_bib34 article-title: An algorithm for buffer allocation with linear resource constraints in a continuous-flow unreliable production line publication-title: Asia-Pac J Oper Res – volume: 34 start-page: 3084 year: 2007 ident: 10.1016/j.cor.2015.01.009_bib49 article-title: Scheduling algorithm for real-time tasks using multi objective hybrid genetic algorithm in heterogeneous multiprocessors system publication-title: Comput Oper Res doi: 10.1016/j.cor.2005.11.016 – volume: 31 start-page: 287 year: 1999 ident: 10.1016/j.cor.2015.01.009_bib6 article-title: An algorithm for optimal buffer placement in reliable serial lines publication-title: IIE Trans doi: 10.1080/07408179908969834 – volume: 125 start-page: 224 year: 2010 ident: 10.1016/j.cor.2015.01.009_bib57 article-title: Buffer and throughput trade-offs in M/G/1/K queuing networks: a bicriteria approach publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2010.02.017 – volume: 5 start-page: 441 year: 2000 ident: 10.1016/j.cor.2015.01.009_bib20 article-title: Stochastic algorithms for buffer allocation in reliable production lines publication-title: Math Probl Eng doi: 10.1155/S1024123X99001180 – volume: 38 start-page: 509 issue: 3 year: 2000 ident: 10.1016/j.cor.2015.01.009_bib31 article-title: Large production line optimization using simulated annealing publication-title: Int J Prod Res doi: 10.1080/002075400189284 – volume: 3 start-page: 209 year: 2004 ident: 10.1016/j.cor.2015.01.009_bib30 article-title: A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines publication-title: Math Probl Eng doi: 10.1155/S1024123X04402014 – volume: 106 start-page: 301 year: 1998 ident: 10.1016/j.cor.2015.01.009_bib22 article-title: Determining buffer location and size in production lines using tabu search publication-title: Eur J Oper Res doi: 10.1016/S0377-2217(97)00276-2 – volume: 44 start-page: 4067 issue: 18–19 year: 2006 ident: 10.1016/j.cor.2015.01.009_bib56 article-title: Analysis and design of split and merge unpaced assembly systems by metamodelling and stochastic search publication-title: Int J Prod Res doi: 10.1080/00207540600564625 – ident: 10.1016/j.cor.2015.01.009_bib61 – volume: 92 start-page: 1 year: 1996 ident: 10.1016/j.cor.2015.01.009_bib4 article-title: Queuing theory in manufacturing systems analysis and design: a classification of models for production and transfer lines publication-title: Eur J Oper Res doi: 10.1016/0377-2217(95)00378-9 – volume: 39 start-page: 424 issue: 2 year: 2012 ident: 10.1016/j.cor.2015.01.009_bib26 article-title: A comparison of genetic programming and artificial neural networks in metamodeling of discrete-event simulation models publication-title: Comput Oper Res doi: 10.1016/j.cor.2011.05.004 – volume: 61 start-page: 447 issue: 3 year: 2011 ident: 10.1016/j.cor.2015.01.009_bib25 article-title: Comparison of experimental designs for simulation-based symbolic regression of manufacturing systems publication-title: Comput Ind Eng doi: 10.1016/j.cie.2011.03.012 – volume: 35 start-page: 1 year: 2003 ident: 10.1016/j.cor.2015.01.009_bib45 article-title: Optimal buffer allocation in production lines publication-title: IIE Trans doi: 10.1080/07408170304431 – volume: 122 start-page: 725 year: 2009 ident: 10.1016/j.cor.2015.01.009_bib40 article-title: An efficient buffer design algorithm for production line profit maximization publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2009.06.040 – volume: 39 start-page: 1477 issue: 7 year: 2012 ident: 10.1016/j.cor.2015.01.009_bib41 article-title: An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines publication-title: Comput Oper Res doi: 10.1016/j.cor.2011.08.019 – volume: 25 start-page: 371 issue: 3 year: 2014 ident: 10.1016/j.cor.2015.01.009_bib5 article-title: The state of the art on buffer allocation problem: a comprehensive survey publication-title: J Intell Manuf doi: 10.1007/s10845-012-0687-9 – volume: 15 start-page: 194 year: 1964 ident: 10.1016/j.cor.2015.01.009_bib7 article-title: The effects of breakdowns and interstage storage on production line capacity publication-title: J Ind Eng – volume: 38 start-page: 39 year: 2006 ident: 10.1016/j.cor.2015.01.009_bib18 article-title: Simultaneous optimization of work and buffer space in unpaced production lines with random processing times publication-title: IIE Trans doi: 10.1080/07408170500208289 – volume: 17 start-page: 651 year: 1966 ident: 10.1016/j.cor.2015.01.009_bib63 article-title: The effect of some design factors on the efficiency of production lines with variable operation times publication-title: J Ind Eng – volume: 29 start-page: 2043 year: 1991 ident: 10.1016/j.cor.2015.01.009_bib10 article-title: The effect of machine breakdowns and interstage storage on production line systems publication-title: Int J Prod Res doi: 10.1080/00207549108948066 – volume: 29 start-page: 103 year: 2002 ident: 10.1016/j.cor.2015.01.009_bib44 article-title: Buffer allocation in flow-shop-type production systems with general arrival and service patterns publication-title: Comput Oper Res doi: 10.1016/S0305-0548(00)00060-5 – volume: 62 start-page: 371 year: 2011 ident: 10.1016/j.cor.2015.01.009_bib46 article-title: Buffer allocation in unreliable production lines based on design of experiments, simulation, and genetic algorithm publication-title: Int J Adv Manuf doi: 10.1007/s00170-011-3802-8 – volume: 25 start-page: 721 year: 1979 ident: 10.1016/j.cor.2015.01.009_bib65 article-title: On the optimal allocation of work in symmetrically unbalanced production line systems with variable operation times publication-title: Manag. Sci doi: 10.1287/mnsc.25.8.721 |
| SSID | ssj0000721 |
| Score | 2.3736591 |
| Snippet | The buffer allocation problem is an NP-hard combinatorial optimization problem involving the determination of the number of buffers in buffer locations... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 67 |
| SubjectTerms | Allocations Assembly lines Buffer allocation problem Buffer inventories Buffers Combinatorial analysis Combinatorial optimization Computer simulation Genetic algorithms Hybrid meta-heuristics Optimization Optimization techniques Production capacity Production lines Serials Studies |
| Title | Hybrid approach for buffer allocation in open serial production lines |
| URI | https://dx.doi.org/10.1016/j.cor.2015.01.009 https://www.proquest.com/docview/1672168671 https://www.proquest.com/docview/1701041891 |
| Volume | 60 |
| WOSCitedRecordID | wos000353730600006&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 Freedom Collection - Elsevier customDbUrl: eissn: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1baxQxFA7LVkQfvKyKW6tE8MllINO5JHksslKtVMEK61OYZDIydZ2WvZTWX-85k2RmWWmxD8IyLHMJIeeb5JuTc75DyBthUNQKmBtLTYLeKhaJONeRjjXfr0QOlm51Zj_x42Mxm8kvg8FRyIW5mPOmEZeX8vy_mhrOgbExdfYW5u4ahRPwH4wORzA7HP_J8IdXmITViYW7eMw1lkGZ4Ca7c9GhmwMLZ01clzBMq3Q6shPknctNzhoKPyxbmMBTCx8-54WCOofyka_S-LX-9cNOvtv5TxiXemOXv26MaaMHPv82HpXe4RBnXbhbl2iF8X6ZE8gMk6grCuBnQVdgw6-nrkLPXzO1cxqcwkCjKmvsxFOZ7JelsBW_tVp1MYQhPO1UQRMKm1AsVm0y584-z6QYkp2DD9PZx35h5m0aXtf_sMndhvtt9eM6mrK1YLcs5OQReeA_H-iBM_tjMrDNiNwN2Qsj8jAYi_pJe0Tub0hOPiFTBw8a4EEBHtTBg_bwoHVDER7UwYP28KAtPJ6Sb--nJ-8OI19KIzLASFeRECazccY5KzNgIzqXleYmByqimc0r4CpWSPilla7wG0IwAxM7w_pkRSmTLHlGhs1ZY58TmopCmFKWOi90qrkUGki5LSurk4ILlowJCyOnjNeZx3Inc3WtxcbkbffIuRNZuenmNJhDeZbo2J8CaN302F4wnfJv61LFOWpXocTjmLzuLsMEi7tmRWPP1nAPR5dFLGS8e5tuviD3-pdnjwxXi7V9Se6Yi1W9XLzy0PwDNqCchg |
| 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=Hybrid+approach+for+buffer+allocation+in+open+serial+production+lines&rft.jtitle=Computers+%26+operations+research&rft.au=Kose%2C+Simge+Yelkenci&rft.au=Kilincci%2C+Ozcan&rft.date=2015-08-01&rft.issn=0305-0548&rft.volume=60&rft.spage=67&rft.epage=78&rft_id=info:doi/10.1016%2Fj.cor.2015.01.009&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cor_2015_01_009 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |