Two-sided assembly line balancing problem of type I: Improvements, a simple algorithm and a comprehensive study
Many meta-heuristic methods have been applied to solve the two-sided assembly line balancing problem of type I with the objective of minimizing the number of stations, but some of them are very complex or intricate to be extended. In addition, different decoding schemes and different objectives have...
Uložené v:
| Vydané v: | Computers & operations research Ročník 79; s. 78 - 93 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Elsevier Ltd
01.03.2017
Pergamon Press Inc |
| Predmet: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Many meta-heuristic methods have been applied to solve the two-sided assembly line balancing problem of type I with the objective of minimizing the number of stations, but some of them are very complex or intricate to be extended. In addition, different decoding schemes and different objectives have been proposed, leading to the different performances of these algorithms and unfair comparison. In this paper, two new decoding schemes with reduced search space are developed to balance the workload within a mated-station and reduce sequence-depended idle time. Then, graded objectives are employed to preserve the minor improvements on the solutions. Finally, a simple iterated greedy algorithm is extended for the two-sided assembly line balancing problem and modified NEH-based heuristic is introduced to obtain a high quality initial solution. And an improved local search with referenced permutation and reduced insert operators is developed to accelerate the search process. Computational results on benchmark problems prove the efficiency of the proposed decoding schemes and the new graded objectives. A comprehensive computational comparison among 14 meta-heuristics is carried out to demonstrate the efficiency of the improved iterated greedy algorithm.
•Two new decoding schemes are developed and compared with existed ones.•Graded objectives are developed to preserve the tiny improvements•A simple and effective iterated greedy algorithm is applied and evaluated.•New local search is developed to reduce repeated insert operators.•All optimal solutions are obtained for the first time. |
|---|---|
| AbstractList | Many meta-heuristic methods have been applied to solve the two-sided assembly line balancing problem of type I with the objective of minimizing the number of stations, but some of them are very complex or intricate to be extended. In addition, different decoding schemes and different objectives have been proposed, leading to the different performances of these algorithms and unfair comparison. In this paper, two new decoding schemes with reduced search space are developed to balance the workload within a mated-station and reduce sequence-depended idle time. Then graded objectives are employed to preserve the minor improvements on the solutions. Finally, a simple iterated greedy algorithm is extended for the two-sided assembly line balancing problem and modified NEH-based heuristic is introduced to obtain a high quality initial solution. And an improved local search with referenced permutation and reduced insert operators is developed to accelerate the search process. Computational results on benchmark problems prove the efficiency of the proposed decoding schemes and the new graded objectives. A comprehensive computational comparison among 14 meta-heuristics is carried out to demonstrate the efficiency of the improved iterated greedy algorithm. Many meta-heuristic methods have been applied to solve the two-sided assembly line balancing problem of type I with the objective of minimizing the number of stations, but some of them are very complex or intricate to be extended. In addition, different decoding schemes and different objectives have been proposed, leading to the different performances of these algorithms and unfair comparison. In this paper, two new decoding schemes with reduced search space are developed to balance the workload within a mated-station and reduce sequence-depended idle time. Then, graded objectives are employed to preserve the minor improvements on the solutions. Finally, a simple iterated greedy algorithm is extended for the two-sided assembly line balancing problem and modified NEH-based heuristic is introduced to obtain a high quality initial solution. And an improved local search with referenced permutation and reduced insert operators is developed to accelerate the search process. Computational results on benchmark problems prove the efficiency of the proposed decoding schemes and the new graded objectives. A comprehensive computational comparison among 14 meta-heuristics is carried out to demonstrate the efficiency of the improved iterated greedy algorithm. •Two new decoding schemes are developed and compared with existed ones.•Graded objectives are developed to preserve the tiny improvements•A simple and effective iterated greedy algorithm is applied and evaluated.•New local search is developed to reduce repeated insert operators.•All optimal solutions are obtained for the first time. |
| Author | Zhang, LiPing Tang, Qiuhua Li, Zixiang |
| Author_xml | – sequence: 1 givenname: Zixiang surname: Li fullname: Li, Zixiang email: zixiangli@126.com – sequence: 2 givenname: Qiuhua surname: Tang fullname: Tang, Qiuhua email: tangqiuhua@wust.edu.cn – sequence: 3 givenname: LiPing surname: Zhang fullname: Zhang, LiPing |
| BookMark | eNp9kM1OAyEURompiW31AdyRuHUqDMMw1ZVp_GnSxE1N3BGGudPSzEAFWtO3l6auXJQNcPOde-GM0MA6CwjdUjKhhJYPm4l2fpKnY7pPCCkv0JBWgmWi5F8DNCSM8IzworpCoxA2JC2R0yFyyx-XBdNAg1UI0NfdAXfGAq5Vp6w2doW33tUd9Ni1OB62gOePeN6n4h56sDHcY4WD6bcdYNWtnDdx3WNlUz-sXcrBGmwwe8Ah7prDNbpsVRfg5m8fo8_Xl-XsPVt8vM1nz4tMM1HFjHEAVsA0b0jRijxnVOu80dOyrvJWcN62nBDN6ikrieacKCFUUWmqmSpKCoSN0d2pb3ro9w5ClBu38zaNlEnLlBS0YiKl6CmlvQvBQyu33vTKHyQl8uhVbmTyKo9ej6XkNTHiH6NNVNE4G70y3Vny6URC-vjegJdBG7AaGuNBR9k4c4b-Be8tlSM |
| CODEN | CMORAP |
| CitedBy_id | crossref_primary_10_1080_00207543_2020_1724344 crossref_primary_10_3390_systems10060218 crossref_primary_10_1016_j_ifacol_2017_08_1122 crossref_primary_10_1007_s00521_017_2855_5 crossref_primary_10_1088_1742_6596_1303_1_012145 crossref_primary_10_3390_pr10030553 crossref_primary_10_1016_j_engappai_2022_105417 crossref_primary_10_1007_s11465_018_0518_6 crossref_primary_10_1016_j_cor_2020_105064 crossref_primary_10_1088_1757_899X_400_4_042006 crossref_primary_10_1016_j_cor_2019_104857 crossref_primary_10_1016_j_ifacol_2018_08_429 crossref_primary_10_1016_j_engappai_2025_110162 crossref_primary_10_1007_s11740_018_0836_x crossref_primary_10_1016_j_cor_2017_03_002 crossref_primary_10_1016_j_ijpe_2018_08_009 crossref_primary_10_3390_app13137439 crossref_primary_10_1016_j_swevo_2019_100567 crossref_primary_10_1007_s12293_020_00319_0 crossref_primary_10_1016_j_cor_2020_104905 crossref_primary_10_1177_1063293X20987910 crossref_primary_10_1080_00207543_2025_2473067 crossref_primary_10_1155_2021_4196228 crossref_primary_10_1080_00207543_2019_1683255 crossref_primary_10_1080_00207543_2017_1394599 crossref_primary_10_1080_00207543_2021_1901152 crossref_primary_10_1016_j_engappai_2021_104183 crossref_primary_10_1016_j_cie_2017_07_005 crossref_primary_10_1016_j_ejor_2020_01_032 crossref_primary_10_1108_AA_04_2019_0064 crossref_primary_10_1017_S0263574720001265 crossref_primary_10_1080_00207543_2017_1402136 |
| Cites_doi | 10.1016/j.eswa.2011.03.089 10.1016/j.cie.2014.06.006 10.1016/j.cor.2008.06.009 10.1016/j.ejor.2009.11.033 10.1016/j.asoc.2015.11.017 10.1057/palgrave.jors.2601708 10.1016/j.cie.2011.08.015 10.1080/00207540701418960 10.1080/00207549308956868 10.1080/0951192X.2012.664786 10.1080/09537287.2014.994685 10.1007/s10845-014-0919-2 10.3901/CJME.2015.0630.084 10.1080/00207543.2013.879618 10.1007/s00170-008-1753-5 10.1016/j.cie.2014.12.037 10.1007/s00170-006-0861-3 10.1080/01621459.1937.10503522 10.1080/095372800232478 10.1016/j.cie.2013.08.006 10.1016/j.jclepro.2016.06.131 10.1016/j.cie.2014.07.010 10.1016/j.cor.2016.03.003 10.1016/j.cie.2016.05.004 10.1016/j.cor.2011.01.010 10.1080/00207543.2014.955218 10.1080/00207540903140750 10.1016/j.ejor.2004.07.022 10.1016/j.cie.2007.10.007 10.1016/j.ejor.2005.12.009 10.1080/00207543.2011.631599 10.1016/S0360-8352(01)00029-8 10.1016/j.ejor.2006.10.010 10.1016/j.ejor.2010.02.034 10.1016/j.cie.2008.11.012 10.1007/s00170-007-1286-3 10.1007/s10845-013-0770-x 10.1007/s00170-014-5816-5 10.1007/s00170-014-5945-x 10.1016/j.cor.2007.11.003 10.1016/j.ejor.2006.07.029 10.1016/j.cor.2014.07.011 10.1016/0305-0483(83)90088-9 10.1016/j.omega.2010.07.007 10.1016/j.mcm.2011.06.010 10.1007/s10878-015-9959-6 10.1080/00207540903074991 10.1007/s00170-007-1120-y 10.1016/j.ijpe.2014.08.010 10.1016/j.asoc.2012.06.003 |
| ContentType | Journal Article |
| Copyright | 2016 Elsevier Ltd Copyright Pergamon Press Inc. Mar 2017 |
| Copyright_xml | – notice: 2016 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Mar 2017 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.cor.2016.10.006 |
| 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 |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X 0305-0548 |
| EndPage | 93 |
| ExternalDocumentID | 4321012615 10_1016_j_cor_2016_10_006 S0305054816302544 |
| 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 AFXIZ AGCQF AGRNS JQ2 L7M L~C L~D SSH |
| ID | FETCH-LOGICAL-c378t-35ee34e92d04f72231cc2dc96b82f755ff500c3b9360c550a77a48c1c3a461e03 |
| ISICitedReferencesCount | 37 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000393002200008&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 | Fri Jul 25 05:33:32 EDT 2025 Sat Nov 29 07:48:37 EST 2025 Tue Nov 18 20:40:39 EST 2025 Fri Feb 23 02:33:28 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Two-sided assembly line Local search Assembly line balancing Iterated greedy Metaheuristics |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c378t-35ee34e92d04f72231cc2dc96b82f755ff500c3b9360c550a77a48c1c3a461e03 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 1879041837 |
| PQPubID | 45870 |
| PageCount | 16 |
| ParticipantIDs | proquest_journals_1879041837 crossref_primary_10_1016_j_cor_2016_10_006 crossref_citationtrail_10_1016_j_cor_2016_10_006 elsevier_sciencedirect_doi_10_1016_j_cor_2016_10_006 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-03-01 |
| PublicationDateYYYYMMDD | 2017-03-01 |
| PublicationDate_xml | – month: 03 year: 2017 text: 2017-03-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2017 |
| Publisher | Elsevier Ltd Pergamon Press Inc |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc |
| References | Roshani, Fattahi, Roshani, Salehi, Roshani (bib41) 2012; 25 Nawaz, Enscore, Ham (bib29) 1983; 11 Özbakir, Tapkan (bib36) 2011; 38 Minella, Ruiz, Ciavotta (bib28) 2011; 38 Yang, Zhang, Zhu (bib53) 2016; 32 Tapkan, Ozbakir, Baykasoglu (bib48) 2012; 12 Özcan, Toklu (bib32) 2009; 36 Chiang, Urban, Luo (bib7) 2015 Khorasanian, Hejazi, Moslehi (bib14) 2013; 66 Tuncel, Aydin (bib50) 2014; 74 Yuan, Zhang, Shao, Jiang (bib55) 2015; 53 Framinana, Leisten (bib10) 2008; 46 Lee, Kim, Kim (bib23) 2001; 40 Kucukkoc, Zhang (bib20) 2015; 84 Ağpak, Zolfaghari (bib3) 2015; 53 Tapkan, Özbakır, Baykasoğlu (bib49) 2016; 39 Boysen, Fliedner, Scholl (bib6) 2007; 183 Kucukkoc, Zhang (bib18) 2014; 158 Kucukkoc, Zhang (bib17) 2014; 52 Li, Zhang, Shao, Lin (bib24) 2016; 27 Tang, Li, Zhang (bib47) 2016; 97 Pan, Wang, Zhao (bib37) 2008; 38 Ruiz, Stützle (bib43) 2008; 187 Delice, Aydoğan, Özcan, İlkay (bib9) 2014 Ruiz, Stützle (bib42) 2007; 177 Li, Tang, Zhang (bib26) 2016 Özcan (bib30) 2010; 205 Ağpak, Yegül, Gökçen (bib2) 2012; 50 Baykasoglu, Dereli (bib5) 2006; 36 Kucukkoc, Zhang (bib19) 2015; 26 Yuan, Zhang, Shao (bib54) 2015; 26 Lapierre, Ruiz (bib21) 2004; 55 Simaria, Vilarinho (bib45) 2009; 56 Özcan, Gökçen, Toklu (bib34) 2010; 48 Purnomo, Wee (bib40) 2014; 76 Make, Rashid, Razali (bib27) 2016 Kim, Kim, Kim (bib15) 2000; 11 Özcan, Toklu (bib31) 2009; 43 Helgeson, Birnie (bib12) 1961; 12 Hu, Wu, Bao, Ye (bib13) 2010; 206 Lei, Guo (bib22) 2016; 72 Ribas, Companys, Tort-Martorell (bib38) 2011; 39 Li, Tang, Zhang (bib25) 2016; 135 Aghajani, Ghodsi, Javadi (bib1) 2014; 74 Bartholdi (bib4) 1993; 31 Wang, Guan, Li, Zhang, Chen (bib51) 2014; 74 Wu, Jin, Bao, Hu (bib52) 2008; 39 Chutima, Chimklai (bib8) 2012; 62 Scholl, Becker (bib44) 2006; 168 Özcan, Toklu (bib33) 2009; 57 Özcan, Toklu (bib35) 2010; 48 Friedman (bib11) 1937; 32 Purnomo, Wee, Rau (bib39) 2013; 57 Tang, Li, Zhang, Floudas, Cao (bib46) 2015; 28 Kim, Song, Kim (bib16) 2009; 36 Li (10.1016/j.cor.2016.10.006_bib25) 2016; 135 Friedman (10.1016/j.cor.2016.10.006_bib11) 1937; 32 Simaria (10.1016/j.cor.2016.10.006_bib45) 2009; 56 Özcan (10.1016/j.cor.2016.10.006_bib34) 2010; 48 Wu (10.1016/j.cor.2016.10.006_bib52) 2008; 39 Khorasanian (10.1016/j.cor.2016.10.006_bib14) 2013; 66 Özcan (10.1016/j.cor.2016.10.006_bib30) 2010; 205 Minella (10.1016/j.cor.2016.10.006_bib28) 2011; 38 Ruiz (10.1016/j.cor.2016.10.006_bib43) 2008; 187 Bartholdi (10.1016/j.cor.2016.10.006_bib4) 1993; 31 Hu (10.1016/j.cor.2016.10.006_bib13) 2010; 206 Chutima (10.1016/j.cor.2016.10.006_bib8) 2012; 62 Özcan (10.1016/j.cor.2016.10.006_bib31) 2009; 43 Purnomo (10.1016/j.cor.2016.10.006_bib39) 2013; 57 Tapkan (10.1016/j.cor.2016.10.006_bib48) 2012; 12 Kucukkoc (10.1016/j.cor.2016.10.006_bib20) 2015; 84 Tapkan (10.1016/j.cor.2016.10.006_bib49) 2016; 39 Nawaz (10.1016/j.cor.2016.10.006_bib29) 1983; 11 Delice (10.1016/j.cor.2016.10.006_bib9) 2014 Helgeson (10.1016/j.cor.2016.10.006_bib12) 1961; 12 Pan (10.1016/j.cor.2016.10.006_bib37) 2008; 38 Kucukkoc (10.1016/j.cor.2016.10.006_bib17) 2014; 52 Özbakir (10.1016/j.cor.2016.10.006_bib36) 2011; 38 Boysen (10.1016/j.cor.2016.10.006_bib6) 2007; 183 Make (10.1016/j.cor.2016.10.006_bib27) 2016 Ağpak (10.1016/j.cor.2016.10.006_bib3) 2015; 53 Lei (10.1016/j.cor.2016.10.006_bib22) 2016; 72 Kim (10.1016/j.cor.2016.10.006_bib16) 2009; 36 Yuan (10.1016/j.cor.2016.10.006_bib54) 2015; 26 Lee (10.1016/j.cor.2016.10.006_bib23) 2001; 40 Yuan (10.1016/j.cor.2016.10.006_bib55) 2015; 53 Tang (10.1016/j.cor.2016.10.006_bib47) 2016; 97 Wang (10.1016/j.cor.2016.10.006_bib51) 2014; 74 Özcan (10.1016/j.cor.2016.10.006_bib32) 2009; 36 Kim (10.1016/j.cor.2016.10.006_bib15) 2000; 11 Kucukkoc (10.1016/j.cor.2016.10.006_bib19) 2015; 26 Tang (10.1016/j.cor.2016.10.006_bib46) 2015; 28 Ruiz (10.1016/j.cor.2016.10.006_bib42) 2007; 177 Yang (10.1016/j.cor.2016.10.006_bib53) 2016; 32 Framinana (10.1016/j.cor.2016.10.006_bib10) 2008; 46 Kucukkoc (10.1016/j.cor.2016.10.006_bib18) 2014; 158 Li (10.1016/j.cor.2016.10.006_bib26) 2016 Tuncel (10.1016/j.cor.2016.10.006_bib50) 2014; 74 Ribas (10.1016/j.cor.2016.10.006_bib38) 2011; 39 Aghajani (10.1016/j.cor.2016.10.006_bib1) 2014; 74 Purnomo (10.1016/j.cor.2016.10.006_bib40) 2014; 76 Ağpak (10.1016/j.cor.2016.10.006_bib2) 2012; 50 Özcan (10.1016/j.cor.2016.10.006_bib35) 2010; 48 Özcan (10.1016/j.cor.2016.10.006_bib33) 2009; 57 Roshani (10.1016/j.cor.2016.10.006_bib41) 2012; 25 Chiang (10.1016/j.cor.2016.10.006_bib7) 2015 Li (10.1016/j.cor.2016.10.006_bib24) 2016; 27 Baykasoglu (10.1016/j.cor.2016.10.006_bib5) 2006; 36 Scholl (10.1016/j.cor.2016.10.006_bib44) 2006; 168 Lapierre (10.1016/j.cor.2016.10.006_bib21) 2004; 55 |
| References_xml | – year: 2016 ident: bib27 article-title: A review of two-sided assembly line balancing problem publication-title: Int J Adv Manuf Technol – volume: 38 start-page: 1521 year: 2011 end-page: 1533 ident: bib28 article-title: Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems publication-title: Comput Oper Res – volume: 72 start-page: 183 year: 2016 end-page: 188 ident: bib22 article-title: Variable neighborhood search for the second type of two-sided assembly line balancing problem publication-title: Comput Oper Res – volume: 25 start-page: 689 year: 2012 end-page: 715 ident: bib41 article-title: Cost-oriented two-sided assembly line balancing problem: a simulated annealing approach publication-title: Int J Comput Integr Manuf – volume: 27 start-page: 725 year: 2016 end-page: 739 ident: bib24 article-title: A multi-objective TLBO algorithm for balancing two-sided assembly line with multiple constraints publication-title: J Intell Manuf – volume: 38 start-page: 11947 year: 2011 end-page: 11957 ident: bib36 article-title: Bee colony intelligence in zone constrained two-sided assembly line balancing problem publication-title: Expert Syst Appl – volume: 36 start-page: 582 year: 2006 end-page: 588 ident: bib5 article-title: Two-sided assembly line balancing using an ant-colony-based heuristic publication-title: Int J Adv Manuf Technol – volume: 11 start-page: 91 year: 1983 end-page: 95 ident: bib29 article-title: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem publication-title: Omega – volume: 57 start-page: 189 year: 2013 end-page: 199 ident: bib39 article-title: Two-sided assembly lines balancing with assignment restrictions publication-title: Math Comput Model – volume: 38 start-page: 778 year: 2008 end-page: 786 ident: bib37 article-title: An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion publication-title: Int J Adv Manuf Technol – volume: 187 start-page: 1143 year: 2008 end-page: 1159 ident: bib43 article-title: An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives publication-title: Eur J Oper Res – volume: 97 start-page: 146 year: 2016 end-page: 156 ident: bib47 article-title: An effective discrete artificial bee colony algorithm with idle time reduction techniques for two-sided assembly line balancing problem of type-II publication-title: Comput Ind Eng – volume: 12 start-page: 3343 year: 2012 end-page: 3355 ident: bib48 article-title: Modeling and solving constrained two-sided assembly line balancing problem via bee algorithms publication-title: Appl Soft Comput – volume: 39 start-page: 1009 year: 2008 end-page: 1015 ident: bib52 article-title: A branch-and-bound algorithm for two-sided assembly line balancing publication-title: Int J Adv Manuf Technol – start-page: 4536426 year: 2016 ident: bib26 article-title: Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm publication-title: Math Probl Eng, 2016, Artic ID – volume: 53 start-page: 1242 year: 2015 end-page: 1254 ident: bib3 article-title: Mathematical models for parallel two-sided assembly line balancing problems and extensions publication-title: Int J Prod Res – volume: 11 start-page: 44 year: 2000 end-page: 53 ident: bib15 article-title: Two-sided assembly line balancing: a genetic algorithm approach publication-title: Prod Plan Control – volume: 74 start-page: 1005 year: 2014 end-page: 1016 ident: bib1 article-title: Balancing of robotic mixed-model two-sided assembly line with robot setup times publication-title: Int J Adv Manuf Technol – volume: 36 start-page: 853 year: 2009 end-page: 865 ident: bib16 article-title: A mathematical model and a genetic algorithm for two-sided assembly line balancing publication-title: Comput Oper Res – volume: 183 start-page: 674 year: 2007 end-page: 693 ident: bib6 article-title: A classification of assembly line balancing problems publication-title: Eur J Oper Res – volume: 53 start-page: 32 year: 2015 end-page: 41 ident: bib55 article-title: An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines publication-title: Comput Oper Res – volume: 32 start-page: 675 year: 1937 end-page: 701 ident: bib11 article-title: The use of ranks to avoid the assumption of normality implicit in the analysis of variance publication-title: J Am Stat Assoc – volume: 56 start-page: 489 year: 2009 end-page: 506 ident: bib45 article-title: 2-ANTBAL: an ant colony optimization algorithm for balancing two-sided assembly lines publication-title: Comput Ind Eng – volume: 32 start-page: 396 year: 2016 end-page: 415 ident: bib53 article-title: Multi-neighborhood based path relinking for two-sided assembly line balancing problem publication-title: J Comb Optim – year: 2014 ident: bib9 article-title: A modified particle swarm optimization algorithm to mixed-model two-sided assembly line balancing publication-title: J Intell Manuf – volume: 135 start-page: 508 year: 2016 end-page: 522 ident: bib25 article-title: Minimizing energy consumption and cycle time in two-sided robotic assembly line systems using restarted simulated annealing algorithm publication-title: J Clean Prod – volume: 26 start-page: 159 year: 2015 end-page: 168 ident: bib54 article-title: A late acceptance hill-climbing algorithm for balancing two-sided assembly lines with multiple constraints publication-title: J Intell Manuf – volume: 43 start-page: 822 year: 2009 end-page: 829 ident: bib31 article-title: A tabu search algorithm for two-sided assembly line balancing publication-title: Int J Adv Manuf Technol – volume: 26 start-page: 874 year: 2015 end-page: 894 ident: bib19 article-title: A mathematical model and genetic algorithm-based approach for parallel two-sided assembly line balancing problem publication-title: Prod Plan Control – volume: 66 start-page: 1096 year: 2013 end-page: 1105 ident: bib14 article-title: Two-sided assembly line balancing considering the relationships between tasks publication-title: Comput Ind Eng – volume: 39 start-page: 275 year: 2016 end-page: 291 ident: bib49 article-title: Bee algorithms for parallel two-sided assembly line balancing problem with walking times publication-title: Appl Soft Comput – year: 2015 ident: bib7 article-title: Balancing stochastic two-sided assembly lines publication-title: Int J Prod Res – volume: 74 start-page: 791 year: 2014 end-page: 805 ident: bib51 article-title: Two-sided assembly line balancing with operator number and task constraints: a hybrid imperialist competitive algorithm publication-title: Int J Adv Manuf Technol – volume: 158 start-page: 314 year: 2014 end-page: 333 ident: bib18 article-title: Mathematical model and agent based solution approach for the simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines publication-title: Int J Prod Econ – volume: 28 start-page: 1067 year: 2015 end-page: 1079 ident: bib46 article-title: Effective hybrid teaching-learning-based optimization algorithm for balancing two-sided assembly lines with multiple constraints publication-title: Chin J Mech Eng – volume: 31 start-page: 2447 year: 1993 end-page: 2461 ident: bib4 article-title: Balancing two-sided assembly lines: a case study publication-title: Int J Prod Res – volume: 48 start-page: 4767 year: 2010 end-page: 4784 ident: bib34 article-title: Balancing parallel two-sided assembly lines publication-title: Int J Prod Res – volume: 57 start-page: 217 year: 2009 end-page: 227 ident: bib33 article-title: Balancing of mixed-model two-sided assembly lines publication-title: Comput Ind Eng – volume: 206 start-page: 703 year: 2010 end-page: 707 ident: bib13 article-title: A branch-and-bound algorithm to minimize the line length of a two-sided assembly line publication-title: Eur J Oper Res – volume: 40 start-page: 273 year: 2001 end-page: 292 ident: bib23 article-title: Two-sided assembly line balancing to maximize work relatedness and slackness publication-title: Comput Ind Eng – volume: 50 start-page: 5035 year: 2012 end-page: 5047 ident: bib2 article-title: Two-sided U-type assembly line balancing problem publication-title: Int J Prod Res, 2012 – volume: 205 start-page: 81 year: 2010 end-page: 97 ident: bib30 article-title: Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm publication-title: Eur J Oper Res – volume: 76 start-page: 222 year: 2014 end-page: 230 ident: bib40 article-title: Maximizing production rate and workload balancing in a two-sided assembly line using harmony search publication-title: Comput Ind Eng – volume: 62 start-page: 39 year: 2012 end-page: 55 ident: bib8 article-title: Multi-objective two-sided mixed-model assembly line balancing using particle swarm optimization with negative knowledge publication-title: Comput Ind Eng – volume: 84 start-page: 56 year: 2015 end-page: 69 ident: bib20 article-title: Type-E parallel two-sided assembly line balancing problem: mathematical model and ant colony optimisation based approach with optimised parameters publication-title: Comput Ind Eng – volume: 36 start-page: 1955 year: 2009 end-page: 1965 ident: bib32 article-title: Multiple-criteria decision-making in two-sided assembly line balancing: a goal programming and a fuzzy goal programming models publication-title: Comput Oper Res – volume: 12 start-page: 394 year: 1961 end-page: 398 ident: bib12 article-title: Assembly line balancing using the ranked positional weight technique publication-title: J Ind Eng – volume: 55 start-page: 589 year: 2004 end-page: 597 ident: bib21 article-title: Balancing assembly lines: an industrial case study publication-title: J Oper Res Soc – volume: 177 start-page: 2033 year: 2007 end-page: 2049 ident: bib42 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: Eur J Oper Res – volume: 52 start-page: 3665 year: 2014 end-page: 3687 ident: bib17 article-title: Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines publication-title: Int J Prod Res, 2014 – volume: 46 start-page: 6479 year: 2008 end-page: 6498 ident: bib10 article-title: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm publication-title: Int J Prod Res – volume: 168 start-page: 666 year: 2006 end-page: 693 ident: bib44 article-title: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing publication-title: Eur J Oper Res – volume: 74 start-page: 291 year: 2014 end-page: 299 ident: bib50 article-title: Two-sided assembly line balancing using teaching-learning based optimization algorithm publication-title: Comput Ind Eng – volume: 39 start-page: 293 year: 2011 end-page: 301 ident: bib38 article-title: An iterated greedy algorithm for the flowshop scheduling problem with blocking publication-title: Omega – volume: 48 start-page: 5363 year: 2010 end-page: 5383 ident: bib35 article-title: Balancing two-sided assembly lines with sequence-depended setup times publication-title: Int J Prod Res – volume: 38 start-page: 11947 issue: 9 year: 2011 ident: 10.1016/j.cor.2016.10.006_bib36 article-title: Bee colony intelligence in zone constrained two-sided assembly line balancing problem publication-title: Expert Syst Appl doi: 10.1016/j.eswa.2011.03.089 – volume: 74 start-page: 291 year: 2014 ident: 10.1016/j.cor.2016.10.006_bib50 article-title: Two-sided assembly line balancing using teaching-learning based optimization algorithm publication-title: Comput Ind Eng doi: 10.1016/j.cie.2014.06.006 – volume: 36 start-page: 1955 issue: 6 year: 2009 ident: 10.1016/j.cor.2016.10.006_bib32 article-title: Multiple-criteria decision-making in two-sided assembly line balancing: a goal programming and a fuzzy goal programming models publication-title: Comput Oper Res doi: 10.1016/j.cor.2008.06.009 – volume: 205 start-page: 81 issue: 1 year: 2010 ident: 10.1016/j.cor.2016.10.006_bib30 article-title: Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2009.11.033 – volume: 39 start-page: 275 year: 2016 ident: 10.1016/j.cor.2016.10.006_bib49 article-title: Bee algorithms for parallel two-sided assembly line balancing problem with walking times publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2015.11.017 – volume: 55 start-page: 589 year: 2004 ident: 10.1016/j.cor.2016.10.006_bib21 article-title: Balancing assembly lines: an industrial case study publication-title: J Oper Res Soc doi: 10.1057/palgrave.jors.2601708 – year: 2016 ident: 10.1016/j.cor.2016.10.006_bib27 article-title: A review of two-sided assembly line balancing problem publication-title: Int J Adv Manuf Technol – volume: 62 start-page: 39 issue: 1 year: 2012 ident: 10.1016/j.cor.2016.10.006_bib8 article-title: Multi-objective two-sided mixed-model assembly line balancing using particle swarm optimization with negative knowledge publication-title: Comput Ind Eng doi: 10.1016/j.cie.2011.08.015 – volume: 46 start-page: 6479 issue: 22 year: 2008 ident: 10.1016/j.cor.2016.10.006_bib10 article-title: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm publication-title: Int J Prod Res doi: 10.1080/00207540701418960 – volume: 31 start-page: 2447 issue: 10 year: 1993 ident: 10.1016/j.cor.2016.10.006_bib4 article-title: Balancing two-sided assembly lines: a case study publication-title: Int J Prod Res doi: 10.1080/00207549308956868 – volume: 25 start-page: 689 issue: 8 year: 2012 ident: 10.1016/j.cor.2016.10.006_bib41 article-title: Cost-oriented two-sided assembly line balancing problem: a simulated annealing approach publication-title: Int J Comput Integr Manuf doi: 10.1080/0951192X.2012.664786 – volume: 26 start-page: 874 issue: 11 year: 2015 ident: 10.1016/j.cor.2016.10.006_bib19 article-title: A mathematical model and genetic algorithm-based approach for parallel two-sided assembly line balancing problem publication-title: Prod Plan Control doi: 10.1080/09537287.2014.994685 – volume: 27 start-page: 725 issue: 4 year: 2016 ident: 10.1016/j.cor.2016.10.006_bib24 article-title: A multi-objective TLBO algorithm for balancing two-sided assembly line with multiple constraints publication-title: J Intell Manuf doi: 10.1007/s10845-014-0919-2 – volume: 28 start-page: 1067 issue: 5 year: 2015 ident: 10.1016/j.cor.2016.10.006_bib46 article-title: Effective hybrid teaching-learning-based optimization algorithm for balancing two-sided assembly lines with multiple constraints publication-title: Chin J Mech Eng doi: 10.3901/CJME.2015.0630.084 – volume: 52 start-page: 3665 issue: 12 year: 2014 ident: 10.1016/j.cor.2016.10.006_bib17 article-title: Simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines publication-title: Int J Prod Res, 2014 doi: 10.1080/00207543.2013.879618 – volume: 43 start-page: 822 year: 2009 ident: 10.1016/j.cor.2016.10.006_bib31 article-title: A tabu search algorithm for two-sided assembly line balancing publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-008-1753-5 – volume: 84 start-page: 56 year: 2015 ident: 10.1016/j.cor.2016.10.006_bib20 article-title: Type-E parallel two-sided assembly line balancing problem: mathematical model and ant colony optimisation based approach with optimised parameters publication-title: Comput Ind Eng doi: 10.1016/j.cie.2014.12.037 – volume: 36 start-page: 582 year: 2006 ident: 10.1016/j.cor.2016.10.006_bib5 article-title: Two-sided assembly line balancing using an ant-colony-based heuristic publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-006-0861-3 – volume: 32 start-page: 675 year: 1937 ident: 10.1016/j.cor.2016.10.006_bib11 article-title: The use of ranks to avoid the assumption of normality implicit in the analysis of variance publication-title: J Am Stat Assoc doi: 10.1080/01621459.1937.10503522 – start-page: 4536426 year: 2016 ident: 10.1016/j.cor.2016.10.006_bib26 article-title: Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm publication-title: Math Probl Eng, 2016, Artic ID – volume: 12 start-page: 394 issue: 6 year: 1961 ident: 10.1016/j.cor.2016.10.006_bib12 article-title: Assembly line balancing using the ranked positional weight technique publication-title: J Ind Eng – volume: 11 start-page: 44 issue: 1 year: 2000 ident: 10.1016/j.cor.2016.10.006_bib15 article-title: Two-sided assembly line balancing: a genetic algorithm approach publication-title: Prod Plan Control doi: 10.1080/095372800232478 – volume: 66 start-page: 1096 issue: 4 year: 2013 ident: 10.1016/j.cor.2016.10.006_bib14 article-title: Two-sided assembly line balancing considering the relationships between tasks publication-title: Comput Ind Eng doi: 10.1016/j.cie.2013.08.006 – volume: 135 start-page: 508 year: 2016 ident: 10.1016/j.cor.2016.10.006_bib25 article-title: Minimizing energy consumption and cycle time in two-sided robotic assembly line systems using restarted simulated annealing algorithm publication-title: J Clean Prod doi: 10.1016/j.jclepro.2016.06.131 – volume: 76 start-page: 222 year: 2014 ident: 10.1016/j.cor.2016.10.006_bib40 article-title: Maximizing production rate and workload balancing in a two-sided assembly line using harmony search publication-title: Comput Ind Eng doi: 10.1016/j.cie.2014.07.010 – volume: 72 start-page: 183 year: 2016 ident: 10.1016/j.cor.2016.10.006_bib22 article-title: Variable neighborhood search for the second type of two-sided assembly line balancing problem publication-title: Comput Oper Res doi: 10.1016/j.cor.2016.03.003 – volume: 97 start-page: 146 year: 2016 ident: 10.1016/j.cor.2016.10.006_bib47 article-title: An effective discrete artificial bee colony algorithm with idle time reduction techniques for two-sided assembly line balancing problem of type-II publication-title: Comput Ind Eng doi: 10.1016/j.cie.2016.05.004 – volume: 38 start-page: 1521 issue: 11 year: 2011 ident: 10.1016/j.cor.2016.10.006_bib28 article-title: Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems publication-title: Comput Oper Res doi: 10.1016/j.cor.2011.01.010 – volume: 53 start-page: 1242 issue: 4 year: 2015 ident: 10.1016/j.cor.2016.10.006_bib3 article-title: Mathematical models for parallel two-sided assembly line balancing problems and extensions publication-title: Int J Prod Res doi: 10.1080/00207543.2014.955218 – volume: 48 start-page: 5363 issue: 18 year: 2010 ident: 10.1016/j.cor.2016.10.006_bib35 article-title: Balancing two-sided assembly lines with sequence-depended setup times publication-title: Int J Prod Res doi: 10.1080/00207540903140750 – volume: 168 start-page: 666 issue: 3 year: 2006 ident: 10.1016/j.cor.2016.10.006_bib44 article-title: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2004.07.022 – volume: 56 start-page: 489 issue: 2 year: 2009 ident: 10.1016/j.cor.2016.10.006_bib45 article-title: 2-ANTBAL: an ant colony optimization algorithm for balancing two-sided assembly lines publication-title: Comput Ind Eng doi: 10.1016/j.cie.2007.10.007 – volume: 177 start-page: 2033 issue: 3 year: 2007 ident: 10.1016/j.cor.2016.10.006_bib42 article-title: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2005.12.009 – volume: 50 start-page: 5035 issue: 18 year: 2012 ident: 10.1016/j.cor.2016.10.006_bib2 article-title: Two-sided U-type assembly line balancing problem publication-title: Int J Prod Res, 2012 doi: 10.1080/00207543.2011.631599 – volume: 40 start-page: 273 issue: 3 year: 2001 ident: 10.1016/j.cor.2016.10.006_bib23 article-title: Two-sided assembly line balancing to maximize work relatedness and slackness publication-title: Comput Ind Eng doi: 10.1016/S0360-8352(01)00029-8 – volume: 183 start-page: 674 issue: 2 year: 2007 ident: 10.1016/j.cor.2016.10.006_bib6 article-title: A classification of assembly line balancing problems publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2006.10.010 – volume: 206 start-page: 703 issue: 3 year: 2010 ident: 10.1016/j.cor.2016.10.006_bib13 article-title: A branch-and-bound algorithm to minimize the line length of a two-sided assembly line publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2010.02.034 – volume: 57 start-page: 217 year: 2009 ident: 10.1016/j.cor.2016.10.006_bib33 article-title: Balancing of mixed-model two-sided assembly lines publication-title: Comput Ind Eng doi: 10.1016/j.cie.2008.11.012 – volume: 39 start-page: 1009 year: 2008 ident: 10.1016/j.cor.2016.10.006_bib52 article-title: A branch-and-bound algorithm for two-sided assembly line balancing publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-007-1286-3 – volume: 26 start-page: 159 issue: 1 year: 2015 ident: 10.1016/j.cor.2016.10.006_bib54 article-title: A late acceptance hill-climbing algorithm for balancing two-sided assembly lines with multiple constraints publication-title: J Intell Manuf doi: 10.1007/s10845-013-0770-x – volume: 74 start-page: 791 issue: 5 year: 2014 ident: 10.1016/j.cor.2016.10.006_bib51 article-title: Two-sided assembly line balancing with operator number and task constraints: a hybrid imperialist competitive algorithm publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-014-5816-5 – volume: 74 start-page: 1005 issue: 5 year: 2014 ident: 10.1016/j.cor.2016.10.006_bib1 article-title: Balancing of robotic mixed-model two-sided assembly line with robot setup times publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-014-5945-x – volume: 36 start-page: 853 issue: 3 year: 2009 ident: 10.1016/j.cor.2016.10.006_bib16 article-title: A mathematical model and a genetic algorithm for two-sided assembly line balancing publication-title: Comput Oper Res doi: 10.1016/j.cor.2007.11.003 – year: 2014 ident: 10.1016/j.cor.2016.10.006_bib9 article-title: A modified particle swarm optimization algorithm to mixed-model two-sided assembly line balancing publication-title: J Intell Manuf – volume: 187 start-page: 1143 issue: 3 year: 2008 ident: 10.1016/j.cor.2016.10.006_bib43 article-title: An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2006.07.029 – volume: 53 start-page: 32 year: 2015 ident: 10.1016/j.cor.2016.10.006_bib55 article-title: An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines publication-title: Comput Oper Res doi: 10.1016/j.cor.2014.07.011 – volume: 11 start-page: 91 issue: 1 year: 1983 ident: 10.1016/j.cor.2016.10.006_bib29 article-title: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem publication-title: Omega doi: 10.1016/0305-0483(83)90088-9 – volume: 39 start-page: 293 issue: 3 year: 2011 ident: 10.1016/j.cor.2016.10.006_bib38 article-title: An iterated greedy algorithm for the flowshop scheduling problem with blocking publication-title: Omega doi: 10.1016/j.omega.2010.07.007 – year: 2015 ident: 10.1016/j.cor.2016.10.006_bib7 article-title: Balancing stochastic two-sided assembly lines publication-title: Int J Prod Res – volume: 57 start-page: 189 issue: 1 year: 2013 ident: 10.1016/j.cor.2016.10.006_bib39 article-title: Two-sided assembly lines balancing with assignment restrictions publication-title: Math Comput Model doi: 10.1016/j.mcm.2011.06.010 – volume: 32 start-page: 396 issue: 2 year: 2016 ident: 10.1016/j.cor.2016.10.006_bib53 article-title: Multi-neighborhood based path relinking for two-sided assembly line balancing problem publication-title: J Comb Optim doi: 10.1007/s10878-015-9959-6 – volume: 48 start-page: 4767 issue: 16 year: 2010 ident: 10.1016/j.cor.2016.10.006_bib34 article-title: Balancing parallel two-sided assembly lines publication-title: Int J Prod Res doi: 10.1080/00207540903074991 – volume: 38 start-page: 778 issue: 7–8 year: 2008 ident: 10.1016/j.cor.2016.10.006_bib37 article-title: An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion publication-title: Int J Adv Manuf Technol doi: 10.1007/s00170-007-1120-y – volume: 158 start-page: 314 year: 2014 ident: 10.1016/j.cor.2016.10.006_bib18 article-title: Mathematical model and agent based solution approach for the simultaneous balancing and sequencing of mixed-model parallel two-sided assembly lines publication-title: Int J Prod Econ doi: 10.1016/j.ijpe.2014.08.010 – volume: 12 start-page: 3343 issue: 11 year: 2012 ident: 10.1016/j.cor.2016.10.006_bib48 article-title: Modeling and solving constrained two-sided assembly line balancing problem via bee algorithms publication-title: Appl Soft Comput doi: 10.1016/j.asoc.2012.06.003 |
| SSID | ssj0000721 |
| Score | 2.3719761 |
| Snippet | Many meta-heuristic methods have been applied to solve the two-sided assembly line balancing problem of type I with the objective of minimizing the number of... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 78 |
| SubjectTerms | Algorithms Assembly line balancing Assembly lines Heuristic Iterated greedy Local search Metaheuristics Studies Two-sided assembly line |
| Title | Two-sided assembly line balancing problem of type I: Improvements, a simple algorithm and a comprehensive study |
| URI | https://dx.doi.org/10.1016/j.cor.2016.10.006 https://www.proquest.com/docview/1879041837 |
| Volume | 79 |
| WOSCitedRecordID | wos000393002200008&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: 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/eLvHCXMwtV3fj9JAEN7gnTH64A_UeHqaffBexF7absu2vl0UIoYgJlxCfGm62y30ghQLnPiH-f85-6scpxJ98KUh25YA38fM7PSbGYRewm6Li1AQh4U0dwKSESfO8sjJmeuzIE8hhuZq2AQdDKLxOB42Gj9sLczljM7n0WYTL_4r1LAGYMvS2X-Au35TWIDXADocAXY4_h3w30pHzuDMWhAXiy9s9r2lQkkmRYxcF5-rITJKHiAzsD2ZFtDZBZUsVNCmrWUhOwe30tmkrIrVVM_SSJUIvRJTI3zftqe17Q7MmIilIlW5EJUR25m2QnX6ua90BJ-LDRB0sk0gaNvzqVhP17XHqLPa_WJoXa3JVID3q6VailtDUU3kBCUtLtnVeUqz40D0qE2x-M2aMdZ68oyxtnr4zy9OQOcjLgBD2fDVa59q-d7W49mn_IOPSfe8309GnfFo96xy8IGsb_JgixmekO7iqyNHlclH-ifknabNDXTo0zAGf3B41uuMP2xDAKoK_upvYB-nK2HhtY_1p4DoWmig4p3RfXTXbFTwmSbYA9QQ8ya6ZeskmuieBRob99BEd640t3yIypqI2BIRSyLimojYEBGXOZZExL03-CoNX-MUaxLimoQYSAjLOyTEioSP0Hm3M3r73jHjPRxOaLRySCgECUTsZ26QUwhTPc79jMdtFvk5DcM8D12XExaTtsthI51SmgYR9zhJg7YnXPIYHczLuXiCcM48ngcszWR_yYiwKBDy4jTljLvM946Qa3_jhJve93IEyyyxIseLBGBJJCxyCWA5Qq_qWxa68cu-iwMLXGIiVx2RJsDJfbcdW5ATY0GWiRfR2A3A09Kn-08_Q7e3_7JjdLCq1uI5uskvV8WyemEo-RP-vMJh |
| 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=Two-sided+assembly+line+balancing+problem+of+type+I%3A+Improvements%2C+a+simple+algorithm+and+a+comprehensive+study&rft.jtitle=Computers+%26+operations+research&rft.au=Li%2C+Zixiang&rft.au=Tang%2C+Qiuhua&rft.au=Zhang%2C+LiPing&rft.date=2017-03-01&rft.pub=Pergamon+Press+Inc&rft.issn=0305-0548&rft.eissn=0305-0548&rft.volume=79&rft.spage=78&rft_id=info:doi/10.1016%2Fj.cor.2016.10.006&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=4321012615 |
| 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 |