A mathematical model and a genetic algorithm for two-sided assembly line balancing

A two-sided assembly line is a type of production line where tasks are performed in parallel at both sides of the line. The line is often found in producing large products such as trucks and buses. This paper presents a mathematical model and a genetic algorithm (GA) for two-sided assembly line bala...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 36; číslo 3; s. 853 - 865
Hlavní autori:	Kim, Yeo Keun, Song, Won Seop, Kim, Jun Hyuk
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Kidlington Elsevier Ltd 01.03.2009 Elsevier Pergamon Press Inc
Predmet:	Applied sciences Assembly lines Comparative analysis Exact sciences and technology Genetic algorithm Genetic algorithms Heuristic Inventory control, production control. Distribution Localized evolution Mathematical model Mathematical models Operational research and scientific management Operational research. Management science Studies Two-sided assembly line balancing Two-sided assembly line balancing Mathematical model Genetic algorithm Localized evolution Bus Assembly line Balancing Production line Decoding Modeling Steady state Production management Lorry Coding Heuristic method
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	A two-sided assembly line is a type of production line where tasks are performed in parallel at both sides of the line. The line is often found in producing large products such as trucks and buses. This paper presents a mathematical model and a genetic algorithm (GA) for two-sided assembly line balancing (two-ALB). The mathematical model can be used as a foundation for further practical development in the design of two-sided assembly lines. In the GA, we adopt the strategy of localized evolution and steady-state reproduction to promote population diversity and search efficiency. When designing the GA components, including encoding and decoding schemes, procedures of forming the initial population, and genetic operators, we take account of the features specific to two-ALB. Through computational experiments, the performance of the proposed GA is compared with that of a heuristic and an existing GA with various problem instances. The experimental results show that the proposed GA outperforms the heuristic and the compared GA.
AbstractList	A two-sided assembly line is a type of production line where tasks are performed in parallel at both sides of the line. The line is often found in producing large products such as trucks and buses. This paper presents a mathematical model and a genetic algorithm (GA) for two-sided assembly line balancing (two-ALB). The mathematical model can be used as a foundation for further practical development in the design of two-sided assembly lines. In the GA, we adopt the strategy of localized evolution and steady-state reproduction to promote population diversity and search efficiency. When designing the GA components, including encoding and decoding schemes, procedures of forming the initial population, and genetic operators, we take account of the features specific to two-ALB. Through computational experiments, the performance of the proposed GA is compared with that of a heuristic and an existing GA with various problem instances. The experimental results show that the proposed GA outperforms the heuristic and the compared GA. A two-sided assembly line is a type of production line where tasks are performed in parallel at both sides of the line. The line is often found in producing large products such as trucks and buses. This paper presents a mathematical model and a genetic algorithm (GA) for two-sided assembly line balancing (two-ALB). The mathematical model can be used as a foundation for further practical development in the design of two-sided assembly lines. In the GA, we adopt the strategy of localized evolution and steady-state reproduction to promote population diversity and search efficiency. When designing the GA components, including encoding and decoding schemes, procedures of forming the initial population, and genetic operators, we take account of the features specific to two-ALB. Through computational experiments, the performance of the proposed GA is compared with that of a heuristic and an existing GA with various problem instances. The experimental results show that the proposed GA outperforms the heuristic and the compared GA. [PUBLICATION ABSTRACT]
Author	Kim, Jun Hyuk Kim, Yeo Keun Song, Won Seop
Author_xml	– sequence: 1 givenname: Yeo Keun surname: Kim fullname: Kim, Yeo Keun email: kimyk@chonnam.ac.kr – sequence: 2 givenname: Won Seop surname: Song fullname: Song, Won Seop email: wonseop.song@gmail.com – sequence: 3 givenname: Jun Hyuk surname: Kim fullname: Kim, Jun Hyuk email: junhyuk.kim@gmail.com
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21243226$$DView record in Pascal Francis
BookMark	eNp9kU9r3DAQxUVJoZu0H6A3UWhvdvXHsmx6CqFpA4FCaSA3IY9HGy2ylErehnz7aNn0kkN0GMHwe8PMe6fkJKaIhHzkrOWM9193LaTcCsZ0y3nLmHxDNnzQstG9uj0hGyaZapjqhnfktJQdq08LviG_z-li1zusxYMNdEkzBmrjTC3dYsTapTZsU_br3UJdynR9SE3xM1aiFFym8EiDj0gnG2wEH7fvyVtnQ8EPz_8Zubn8_ufiZ3P968fVxfl1Ax3v1wbnaZiGEYcBhIYRJ-e4g7mbplEKFBotd1oM1jE5CgAQE4xKgXOqE6rnIM_Il-Pc-5z-7rGsZvEFMNQ1MO2LkWrsejXICn56Ae7SPse6m-FjBfio-wp9foZsqUa4fDimmPvsF5sfjeCik0IcOH3kIKdSMjoDfq3mpbhm64PhzBwCMTtTAzGHQAznpgZSlfyF8v_w1zTfjhqsRv7zmE0BjxFw9hlhNXPyr6ifAOJ1pcU
CODEN	CMORAP
CitedBy_id	crossref_primary_10_1007_s40685_019_0101_y crossref_primary_10_1177_0954406218803129 crossref_primary_10_1016_j_mechatronics_2014_10_001 crossref_primary_10_1007_s00521_017_2855_5 crossref_primary_10_1080_00207543_2018_1476786 crossref_primary_10_1016_j_mcm_2011_06_010 crossref_primary_10_1080_0305215X_2024_2349110 crossref_primary_10_1016_j_cie_2014_12_037 crossref_primary_10_1016_j_cor_2011_11_022 crossref_primary_10_1108_RIA_05_2023_0069 crossref_primary_10_1016_j_cie_2016_05_004 crossref_primary_10_1016_j_ijpe_2018_08_009 crossref_primary_10_1080_00207543_2014_955218 crossref_primary_10_1007_s10845_014_0978_4 crossref_primary_10_1080_0305215X_2020_1786081 crossref_primary_10_1016_j_jmsy_2018_07_001 crossref_primary_10_1007_s00500_018_03684_8 crossref_primary_10_1155_2021_4196228 crossref_primary_10_1080_00207543_2019_1683255 crossref_primary_10_1016_j_ejor_2021_11_043 crossref_primary_10_1080_00207543_2016_1140918 crossref_primary_10_1016_j_ejor_2021_12_002 crossref_primary_10_1080_00207543_2011_631599 crossref_primary_10_1177_15589250211055784 crossref_primary_10_7737_JKORMS_2012_37_3_039 crossref_primary_10_1007_s10288_016_0320_4 crossref_primary_10_1016_j_ejor_2009_11_033 crossref_primary_10_1016_j_cor_2008_06_009 crossref_primary_10_1007_s00170_012_4465_9 crossref_primary_10_1016_j_cie_2019_106182 crossref_primary_10_1080_00207543_2019_1633023 crossref_primary_10_1016_j_asoc_2015_11_017 crossref_primary_10_1109_ACCESS_2024_3437410 crossref_primary_10_1007_s00170_014_5816_5 crossref_primary_10_3390_app13137439 crossref_primary_10_3390_sym13020333 crossref_primary_10_1007_s12293_020_00319_0 crossref_primary_10_1016_j_cor_2016_03_003 crossref_primary_10_1080_00207543_2016_1181286 crossref_primary_10_1007_s00170_014_5945_x crossref_primary_10_1016_j_cie_2012_11_010 crossref_primary_10_1016_j_cie_2018_06_014 crossref_primary_10_1007_s00170_010_3053_0 crossref_primary_10_1016_j_cie_2011_08_015 crossref_primary_10_1016_j_apm_2021_07_013 crossref_primary_10_1243_09544054JEM1757 crossref_primary_10_1016_j_cie_2014_06_006 crossref_primary_10_1007_s13198_020_00956_1 crossref_primary_10_1016_j_cor_2012_03_017 crossref_primary_10_1016_j_jmsy_2016_12_011 crossref_primary_10_1080_00207543_2021_1901152 crossref_primary_10_1007_s10845_013_0770_x crossref_primary_10_1108_AA_10_2021_0140 crossref_primary_10_1016_j_cie_2011_03_001 crossref_primary_10_1016_j_asoc_2015_06_001 crossref_primary_10_1007_s11771_015_2940_9 crossref_primary_10_1016_j_cie_2013_08_006 crossref_primary_10_1080_00207543_2013_836613 crossref_primary_10_1016_j_asoc_2012_06_003 crossref_primary_10_1080_16843703_2022_2079062 crossref_primary_10_1016_j_cie_2008_11_012 crossref_primary_10_1080_00207543_2013_879618 crossref_primary_10_1016_j_ijpe_2012_10_020 crossref_primary_10_1080_00207543_2018_1467061 crossref_primary_10_1007_s11081_022_09718_3 crossref_primary_10_1155_2016_4536426 crossref_primary_10_1016_j_eswa_2011_09_038 crossref_primary_10_1007_s00170_011_3545_6 crossref_primary_10_1016_j_cor_2017_03_002 crossref_primary_10_1142_S0217595924500210 crossref_primary_10_1007_s00170_010_2832_y crossref_primary_10_1016_j_cie_2019_106121 crossref_primary_10_1016_j_eswa_2011_03_089 crossref_primary_10_1080_09537287_2014_994685 crossref_primary_10_1007_s10845_014_0919_2 crossref_primary_10_1007_s00170_014_5944_y crossref_primary_10_1016_j_cam_2025_116876 crossref_primary_10_1108_AA_09_2016_112 crossref_primary_10_1088_1742_6596_890_1_012107 crossref_primary_10_1016_j_cie_2016_04_001 crossref_primary_10_1080_00207543_2021_2011982 crossref_primary_10_1016_j_jmsy_2022_02_005 crossref_primary_10_1109_ACCESS_2021_3108818 crossref_primary_10_1155_2014_458959 crossref_primary_10_1016_j_apm_2016_02_022 crossref_primary_10_1016_j_cor_2014_07_011 crossref_primary_10_1016_j_swevo_2024_101662 crossref_primary_10_1007_s00170_016_9158_3 crossref_primary_10_1007_s40092_016_0158_6 crossref_primary_10_1080_00207543_2017_1402136 crossref_primary_10_1080_00207543_2015_1029084 crossref_primary_10_1080_00207543_2020_1724344 crossref_primary_10_1016_j_cor_2012_04_019 crossref_primary_10_1177_0954405411422468 crossref_primary_10_1080_00207540903074991 crossref_primary_10_1016_j_cor_2016_10_006 crossref_primary_10_1007_s10845_016_1201_6 crossref_primary_10_1016_j_cor_2011_07_020 crossref_primary_10_1080_0951192X_2012_664786 crossref_primary_10_1007_s11465_018_0518_6 crossref_primary_10_1016_j_apm_2011_05_016 crossref_primary_10_1007_s11590_011_0344_9 crossref_primary_10_3901_CJME_2015_0630_084 crossref_primary_10_1007_s10846_020_01177_1 crossref_primary_10_1016_j_cor_2015_05_014 crossref_primary_10_1080_00207540903140750 crossref_primary_10_3390_app13063702 crossref_primary_10_1016_j_cie_2014_07_010 crossref_primary_10_1016_j_cor_2014_08_021 crossref_primary_10_1108_AA_08_2020_0114 crossref_primary_10_1016_j_jclepro_2016_06_131 crossref_primary_10_1007_s12293_017_0239_0 crossref_primary_10_1109_TSMC_2016_2598685 crossref_primary_10_1016_j_jmsy_2019_05_009 crossref_primary_10_1080_0740817X_2015_1027456 crossref_primary_10_3390_app14083354 crossref_primary_10_1016_j_ejor_2020_01_032 crossref_primary_10_1007_s11465_019_0544_z crossref_primary_10_1108_EC_12_2018_0593
Cites_doi	10.1080/00207549308956868 10.1016/0377-2217(95)00047-X 10.1007/s10791-005-6621-4 10.1016/j.ejor.2004.07.031 10.1016/S0377-2217(02)00204-7 10.1016/S0360-8352(01)00029-8 10.1016/j.ejor.2004.07.022 10.1287/mnsc.34.2.240 10.1016/B978-0-08-050684-5.50009-4 10.1287/mnsc.32.4.430 10.1080/095372800232478 10.1080/00207548908942574 10.1016/j.ejor.2007.01.022 10.1057/palgrave.jors.2601708 10.1016/S0305-0548(02)00063-1 10.1287/mnsc.32.8.909
ContentType	Journal Article
Copyright	2007 Elsevier Ltd 2009 INIST-CNRS Copyright Pergamon Press Inc. Mar 2009
Copyright_xml	– notice: 2007 Elsevier Ltd – notice: 2009 INIST-CNRS – notice: Copyright Pergamon Press Inc. Mar 2009
DBID	AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/j.cor.2007.11.003
DatabaseName	CrossRef Pascal-Francis 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 Applied Sciences
EISSN	1873-765X 0305-0548
EndPage	865
ExternalDocumentID	1586718971 21243226 10_1016_j_cor_2007_11_003 S0305054807002304
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 AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c416t-edb8b89e88c27c9ebff1fcd4bb932e27ea1f728af0392ccc2bc955cff542561c3
ISICitedReferencesCount	148
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000262843000013&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	Sun Sep 28 00:00:35 EDT 2025 Sun Nov 30 04:04:12 EST 2025 Mon Jul 21 09:17:25 EDT 2025 Sat Nov 29 03:23:33 EST 2025 Tue Nov 18 21:37:43 EST 2025 Fri Feb 23 02:33:27 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	Two-sided assembly line balancing Mathematical model Genetic algorithm Localized evolution Bus Assembly line Balancing Production line Decoding Modeling Steady state Production management Lorry Coding Heuristic method
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c416t-edb8b89e88c27c9ebff1fcd4bb932e27ea1f728af0392ccc2bc955cff542561c3
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23
PQID	195831976
PQPubID	45870
PageCount	13
ParticipantIDs	proquest_miscellaneous_35946583 proquest_journals_195831976 pascalfrancis_primary_21243226 crossref_citationtrail_10_1016_j_cor_2007_11_003 crossref_primary_10_1016_j_cor_2007_11_003 elsevier_sciencedirect_doi_10_1016_j_cor_2007_11_003
PublicationCentury	2000
PublicationDate	2009-03-01
PublicationDateYYYYMMDD	2009-03-01
PublicationDate_xml	– month: 03 year: 2009 text: 2009-03-01 day: 01
PublicationDecade	2000
PublicationPlace	Kidlington
PublicationPlace_xml	– name: Kidlington – name: New York
PublicationTitle	Computers & operations research
PublicationYear	2009
Publisher	Elsevier Ltd Elsevier Pergamon Press Inc
Publisher_xml	– name: Elsevier Ltd – name: Elsevier – name: Pergamon Press Inc
References	Helgeson, Birnie (bib19) 1961; 12 Scholl, Becker (bib5) 2006; 168 Lee, Kim, Kim (bib11) 2001; 40 Lapierre, Ruiz (bib12) 2004; 55 Khuri, Schütz, Heitkötter (bib21) 1995 Ghosh, Gagnon (bib4) 1989; 27 Jones, Beltramo (bib18) 1991 von Laszewski (bib20) 1991 Hu, Wu, Jin (bib10) 2008; 186 Lapierre, Ruiz, Soriano (bib6) 2006; 168 Klein, Scholl (bib9) 1996; 91 Fleszar, Hindi (bib14) 2003; 145 Talbot, Patterson, Gehrlein (bib3) 1986; 32 Baykasoglu A, Dereli T. Two-sided assembly line balancing using an ant-colony-based heuristic. International Journal of Advanced Manufacturing Technology; doi 10.1007/s00170-006-0861-3. Johnson (bib8) 1988; 34 Syswerda (bib17) 1991 Baybars (bib7) 1986; 32 Kim, Park, Ko (bib15) 2003; 30 Bartholdi (bib1) 1993; 31 Kim, Kim, Kim (bib2) 2000; 11 Kim, Kim (bib16) 2005; 22 Lee (10.1016/j.cor.2007.11.003_bib11) 2001; 40 Lapierre (10.1016/j.cor.2007.11.003_bib6) 2006; 168 Johnson (10.1016/j.cor.2007.11.003_bib8) 1988; 34 Bartholdi (10.1016/j.cor.2007.11.003_bib1) 1993; 31 Ghosh (10.1016/j.cor.2007.11.003_bib4) 1989; 27 Syswerda (10.1016/j.cor.2007.11.003_bib17) 1991 Scholl (10.1016/j.cor.2007.11.003_bib5) 2006; 168 Talbot (10.1016/j.cor.2007.11.003_bib3) 1986; 32 Hu (10.1016/j.cor.2007.11.003_bib10) 2008; 186 Kim (10.1016/j.cor.2007.11.003_bib15) 2003; 30 Kim (10.1016/j.cor.2007.11.003_bib16) 2005; 22 von Laszewski (10.1016/j.cor.2007.11.003_bib20) 1991 Klein (10.1016/j.cor.2007.11.003_bib9) 1996; 91 Baybars (10.1016/j.cor.2007.11.003_bib7) 1986; 32 Khuri (10.1016/j.cor.2007.11.003_bib21) 1995 Kim (10.1016/j.cor.2007.11.003_bib2) 2000; 11 Lapierre (10.1016/j.cor.2007.11.003_bib12) 2004; 55 Fleszar (10.1016/j.cor.2007.11.003_bib14) 2003; 145 10.1016/j.cor.2007.11.003_bib13 Jones (10.1016/j.cor.2007.11.003_bib18) 1991 Helgeson (10.1016/j.cor.2007.11.003_bib19) 1961; 12
References_xml	– volume: 22 start-page: 233 year: 2005 end-page: 249 ident: bib16 article-title: Multileveled symbiotic evolutionary algorithm: application to FMS loading problems publication-title: Applied Intelligence – volume: 32 start-page: 909 year: 1986 end-page: 932 ident: bib7 article-title: A survey of exact algorithms for the simple assembly line balancing problem publication-title: Management Science – reference: Baykasoglu A, Dereli T. Two-sided assembly line balancing using an ant-colony-based heuristic. International Journal of Advanced Manufacturing Technology; doi 10.1007/s00170-006-0861-3. – start-page: 94 year: 1991 end-page: 101 ident: bib17 article-title: A study of reproduction in generational and steady-state genetic algorithms publication-title: Foundations of genetic algorithms – volume: 12 start-page: 394 year: 1961 end-page: 398 ident: bib19 article-title: Assembly line balancing using the ranked positional weight technique publication-title: Journal of Industrial Engineering – volume: 27 start-page: 637 year: 1989 end-page: 670 ident: bib4 article-title: A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems publication-title: International Journal of Production Research – start-page: 285 year: 1995 end-page: 288 ident: bib21 article-title: Evolutionary heuristics for the bin packing problem publication-title: Artificial neural nets and genetic algorithms – volume: 91 start-page: 367 year: 1996 end-page: 385 ident: bib9 article-title: Maximizing the production rate in simple assembly line balancing—a branch and bound procedure publication-title: European Journal of Operational Research – volume: 186 start-page: 435 year: 2008 end-page: 440 ident: bib10 article-title: A station-oriented enumerative algorithm for two-sided assembly line balancing publication-title: European Journal of Operational Research – start-page: 442 year: 1991 end-page: 449 ident: bib18 article-title: Solving partitioning problems with genetic algorithms publication-title: Proceedings of the 4th international conference on genetic algorithms – volume: 55 start-page: 589 year: 2004 end-page: 597 ident: bib12 article-title: Balancing assembly lines: an industrial case study publication-title: Journal of the Operational Research Society – volume: 31 start-page: 2447 year: 1993 end-page: 2461 ident: bib1 article-title: Balancing two-sided assembly lines: a case study publication-title: International Journal of Production Research – volume: 11 start-page: 44 year: 2000 end-page: 53 ident: bib2 article-title: Two-sided assembly line balancing: a genetic algorithm approach publication-title: Production Planning and Control – volume: 168 start-page: 826 year: 2006 end-page: 837 ident: bib6 article-title: Balancing assembly lines with tabu search publication-title: European Journal of Operational Research – volume: 145 start-page: 606 year: 2003 end-page: 620 ident: bib14 article-title: An enumerative heuristic and reduction methods for the assembly line balancing problem publication-title: European Journal of Operational Research – volume: 30 start-page: 1151 year: 2003 end-page: 1171 ident: bib15 article-title: A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling publication-title: Computers & Operations Research – volume: 168 start-page: 666 year: 2006 end-page: 693 ident: bib5 article-title: State-of-the art exact and heuristic solution procedures for simple assembly line balancing publication-title: European Journal of Operational Research – volume: 40 start-page: 273 year: 2001 end-page: 292 ident: bib11 article-title: Two-sided assembly line balancing to maximize work relatedness and slackness publication-title: Computers & Industrial Engineering – volume: 32 start-page: 430 year: 1986 end-page: 454 ident: bib3 article-title: A comparative evaluation of heuristic line balancing techniques publication-title: Management Science – volume: 34 start-page: 240 year: 1988 end-page: 253 ident: bib8 article-title: Optimally balancing large assembly lines with FABLE publication-title: Management Science – start-page: 45 year: 1991 end-page: 52 ident: bib20 article-title: Intelligent structural operator for publication-title: Proceedings of the 4th international conference on genetic algorithms – volume: 31 start-page: 2447 year: 1993 ident: 10.1016/j.cor.2007.11.003_bib1 article-title: Balancing two-sided assembly lines: a case study publication-title: International Journal of Production Research doi: 10.1080/00207549308956868 – volume: 91 start-page: 367 year: 1996 ident: 10.1016/j.cor.2007.11.003_bib9 article-title: Maximizing the production rate in simple assembly line balancing—a branch and bound procedure publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00047-X – volume: 22 start-page: 233 issue: 3 year: 2005 ident: 10.1016/j.cor.2007.11.003_bib16 article-title: Multileveled symbiotic evolutionary algorithm: application to FMS loading problems publication-title: Applied Intelligence doi: 10.1007/s10791-005-6621-4 – volume: 168 start-page: 826 year: 2006 ident: 10.1016/j.cor.2007.11.003_bib6 article-title: Balancing assembly lines with tabu search publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.031 – volume: 145 start-page: 606 year: 2003 ident: 10.1016/j.cor.2007.11.003_bib14 article-title: An enumerative heuristic and reduction methods for the assembly line balancing problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00204-7 – start-page: 285 year: 1995 ident: 10.1016/j.cor.2007.11.003_bib21 article-title: Evolutionary heuristics for the bin packing problem – volume: 40 start-page: 273 year: 2001 ident: 10.1016/j.cor.2007.11.003_bib11 article-title: Two-sided assembly line balancing to maximize work relatedness and slackness publication-title: Computers & Industrial Engineering doi: 10.1016/S0360-8352(01)00029-8 – volume: 12 start-page: 394 year: 1961 ident: 10.1016/j.cor.2007.11.003_bib19 article-title: Assembly line balancing using the ranked positional weight technique publication-title: Journal of Industrial Engineering – volume: 168 start-page: 666 issue: 3 year: 2006 ident: 10.1016/j.cor.2007.11.003_bib5 article-title: State-of-the art exact and heuristic solution procedures for simple assembly line balancing publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.022 – volume: 34 start-page: 240 year: 1988 ident: 10.1016/j.cor.2007.11.003_bib8 article-title: Optimally balancing large assembly lines with FABLE publication-title: Management Science doi: 10.1287/mnsc.34.2.240 – start-page: 94 year: 1991 ident: 10.1016/j.cor.2007.11.003_bib17 article-title: A study of reproduction in generational and steady-state genetic algorithms doi: 10.1016/B978-0-08-050684-5.50009-4 – volume: 32 start-page: 430 year: 1986 ident: 10.1016/j.cor.2007.11.003_bib3 article-title: A comparative evaluation of heuristic line balancing techniques publication-title: Management Science doi: 10.1287/mnsc.32.4.430 – volume: 11 start-page: 44 issue: 1 year: 2000 ident: 10.1016/j.cor.2007.11.003_bib2 article-title: Two-sided assembly line balancing: a genetic algorithm approach publication-title: Production Planning and Control doi: 10.1080/095372800232478 – volume: 27 start-page: 637 year: 1989 ident: 10.1016/j.cor.2007.11.003_bib4 article-title: A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems publication-title: International Journal of Production Research doi: 10.1080/00207548908942574 – volume: 186 start-page: 435 year: 2008 ident: 10.1016/j.cor.2007.11.003_bib10 article-title: A station-oriented enumerative algorithm for two-sided assembly line balancing publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2007.01.022 – volume: 55 start-page: 589 year: 2004 ident: 10.1016/j.cor.2007.11.003_bib12 article-title: Balancing assembly lines: an industrial case study publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601708 – start-page: 442 year: 1991 ident: 10.1016/j.cor.2007.11.003_bib18 article-title: Solving partitioning problems with genetic algorithms – volume: 30 start-page: 1151 year: 2003 ident: 10.1016/j.cor.2007.11.003_bib15 article-title: A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(02)00063-1 – volume: 32 start-page: 909 year: 1986 ident: 10.1016/j.cor.2007.11.003_bib7 article-title: A survey of exact algorithms for the simple assembly line balancing problem publication-title: Management Science doi: 10.1287/mnsc.32.8.909 – start-page: 45 year: 1991 ident: 10.1016/j.cor.2007.11.003_bib20 article-title: Intelligent structural operator for k-way group partitioning problem – ident: 10.1016/j.cor.2007.11.003_bib13
SSID	ssj0000721
Score	2.3650773
Snippet	A two-sided assembly line is a type of production line where tasks are performed in parallel at both sides of the line. The line is often found in producing...
SourceID	proquest pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	853
SubjectTerms	Applied sciences Assembly lines Comparative analysis Exact sciences and technology Genetic algorithm Genetic algorithms Heuristic Inventory control, production control. Distribution Localized evolution Mathematical model Mathematical models Operational research and scientific management Operational research. Management science Studies Two-sided assembly line balancing
Title	A mathematical model and a genetic algorithm for two-sided assembly line balancing
URI	https://dx.doi.org/10.1016/j.cor.2007.11.003 https://www.proquest.com/docview/195831976 https://www.proquest.com/docview/35946583
Volume	36
WOSCitedRecordID	wos000262843000013&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/eLvHCXMwtV1bb9MwFLaqDSEmxKWAVgbDDzxRRcp1iR8rNDQGmhAMUZ6i2LHHRptESTO2f8_xtV2nTeyBl6hKHLfp9-WcY_v4Owi99UPCWMSZF5YwNon3aORlgSwiICA8oFkCMYRS1_-cHh1l0yn5Mhj0di_M-SytquzigjT_FWo4B2DLrbN3gNt1CifgM4AOR4Adjv8E_GQ8d1KscmuILHWjJVlluWSuBFpnJ3V7uvg110mGf2pPFu2EFl3H53R2OVaxJ5VZj8y6NqtmYKpAdIozdcNbk0tnVIPc7LIp0_yT1-NPvHcU_GZSgH8oO1U3a80P-2p8cNn_vjIZQZbZWHYTlswFTLR4pjWwWuHEEClasZaZ1gm2jlcXjbhm0_X0whlA0mrJSam66kdLB2YX7df8mss2tIlsZzl0IetupjDuyZVG7GaYJgTs-ebk4_70cOnCU7Vhzz2NXQ5XiYFrv-OmgOZhU3QAs9D1Ua65ehW_HD9Bj8zAA080YZ6iAa-G6L7d9zBEjy2y2Jj7IdpaEat8hr5O8CqxsCIWBmLhAhtiYUcsDMTCjljYEgtLYmFHrOfo-4f94_cHnqnI4TEI3BceL2lGM8KzjIUpI5wKEQhWxpTCMICHKS8CkYZZIXwIuxljIWUkSZiAFx9C64BFL9BGVVd8G-GCQUclg4iYR3HBAlL4JE4E-GYRl2WUjJBv_9acGbl6WTVllt8I5wi9c7c0WqvltsaxxSo3waYOInPg3W237V7B1X0RhIAxOMe9EdqxQOfGKnS5VHQCX5fC1TfuKthxuThXVLzuuzxKSAyjgejlXR5iBz1YvoWv0Mai7flrdI-dL067dtew-i_Qyb_X
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=A+mathematical+model+and+a+genetic+algorithm+for+two-sided+assembly+line+balancing&rft.jtitle=Computers+%26+operations+research&rft.au=Kim%2C+Yeo+Keun&rft.au=Song%2C+Won+Seop&rft.au=Kim%2C+Jun+Hyuk&rft.date=2009-03-01&rft.issn=0305-0548&rft.volume=36&rft.issue=3&rft.spage=853&rft.epage=865&rft_id=info:doi/10.1016%2Fj.cor.2007.11.003&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cor_2007_11_003
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