Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
► Guidelines for systematic testing of algorithm’s performance. ► New generator for realistic and diversified line balancing instances. ► Analysis and new measure of hardness of problem instances. ► Statistical analysis of heuristics’ performance based on new data sets. Recently, the importance of c...
Saved in:
Published in: | European journal of operational research Vol. 228; no. 1; pp. 33 - 45 |
---|---|
Main Authors: | , , |
Format: | Journal Article |
Language: | English |
Published: |
Amsterdam
Elsevier B.V
01-07-2013
Elsevier Sequoia S.A |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Abstract | ► Guidelines for systematic testing of algorithm’s performance. ► New generator for realistic and diversified line balancing instances. ► Analysis and new measure of hardness of problem instances. ► Statistical analysis of heuristics’ performance based on new data sets.
Recently, the importance of correctly designed computational experiments for testing algorithms has been a subject of extended discussions. Whenever real-world data is lacking, generated data sets provide a substantive methodological tool for experiments. Focused research questions need to base on specialized, randomized and sufficiently large data sets, which are sampled from the population of interest. We integrate the generation of data sets into the process of scientific testing.
Until now, no appropriate generators or systematic data sets have been available for the assembly line balancing problem (ALBP). Computational experiments were mostly based on very limited data sets unsystematically collected from the literature and from some real-world cases. As a consequence, former performance analyses often come to contradictory conclusions and lack on statistical evidence.
We introduce SALBPGen, a new instance generator for the simple ALBP which can be applied and extended to any generalized ALBP, too. Unlike most generators, SALBPGen takes into account usual properties of precedence graphs in manufacturing. It is very flexible and able to create instances with very diverse structures under full control of the experiment’s designer. We also propose new challenging data sets, as shown with the new direct measure of instance’s hardness called trickiness. By two exemplary computational experiments, we illustrate how important insights can be gained with the help of the systematically generated data sets. |
---|---|
AbstractList | Recently, the importance of correctly designed computational experiments for testing algorithms has been a subject of extended discussions. Whenever real-world data is lacking, generated data sets provide a substantive methodological tool for experiments. Focused research questions need to base on specialized, randomized and sufficiently large data sets, which are sampled from the population of interest. We integrate the generation of data sets into the process of scientific testing. Until now, no appropriate generators or systematic data sets have been available for the assembly line balancing problem (ALBP). Computational experiments were mostly based on very limited data sets unsystematically collected from the literature and from some real-world cases. As a consequence, former performance analyses often come to contradictory conclusions and lack on statistical evidence. We introduce SALBPGen, a new instance generator for the simple ALBP which can be applied and extended to any generalized ALBP, too. Unlike most generators, SALBPGen takes into account usual properties of precedence graphs in manufacturing. It is very flexible and able to create instances with very diverse structures under full control of the experiment's designer. We also propose new challenging data sets, as shown with the new direct measure of instance's hardness called trickiness. By two exemplary computational experiments, we illustrate how important insights can be gained with the help of the systematically generated data sets. [PUBLICATION ABSTRACT] ► Guidelines for systematic testing of algorithm’s performance. ► New generator for realistic and diversified line balancing instances. ► Analysis and new measure of hardness of problem instances. ► Statistical analysis of heuristics’ performance based on new data sets. Recently, the importance of correctly designed computational experiments for testing algorithms has been a subject of extended discussions. Whenever real-world data is lacking, generated data sets provide a substantive methodological tool for experiments. Focused research questions need to base on specialized, randomized and sufficiently large data sets, which are sampled from the population of interest. We integrate the generation of data sets into the process of scientific testing. Until now, no appropriate generators or systematic data sets have been available for the assembly line balancing problem (ALBP). Computational experiments were mostly based on very limited data sets unsystematically collected from the literature and from some real-world cases. As a consequence, former performance analyses often come to contradictory conclusions and lack on statistical evidence. We introduce SALBPGen, a new instance generator for the simple ALBP which can be applied and extended to any generalized ALBP, too. Unlike most generators, SALBPGen takes into account usual properties of precedence graphs in manufacturing. It is very flexible and able to create instances with very diverse structures under full control of the experiment’s designer. We also propose new challenging data sets, as shown with the new direct measure of instance’s hardness called trickiness. By two exemplary computational experiments, we illustrate how important insights can be gained with the help of the systematically generated data sets. |
Author | Otto, Christian Scholl, Armin Otto, Alena |
Author_xml | – sequence: 1 givenname: Alena surname: Otto fullname: Otto, Alena – sequence: 2 givenname: Christian surname: Otto fullname: Otto, Christian – sequence: 3 givenname: Armin surname: Scholl fullname: Scholl, Armin email: armin.scholl@uni-jena.de |
BookMark | eNp9UMtKxDAUDaLg-PgBVwHXHZOmTVNwo-ILBhTUdUiT2zGlTcYkI87fm6GuhQOXwz3nPs4JOnTeAUIXlCwpofxqWMLgw7IktFxmkLI9QAsqmrLggpNDtCCsaYqypM0xOolxIITQmtYLtHvbxQSTSlZjo5LCa3AQMvUOK2dwgpiwgWjXDvc-4OjH7dwc1z7Y9DlFnFn6BAw_atqMgH2P325Wt6-PMFtUjDB14w6P1gHu1Kictm59ho56NUY4_6un6OPh_v3uqVi9PD7f3awKzUSZCqFF1wNrqqbrDDXCqKptOs05VYTrTlVMVbVgvVLaVIQZRuvOVK3huhWmrTU7RZfz3E3wX9v8jhz8Nri8UlJGBak5b1lWlbNKBx9jgF5ugp1U2ElK5D5iOch9xHIfsczIEWfT9WyCfP-3hSCjtuA0GBtAJ2m8_c_-C-8XiNs |
CODEN | EJORDT |
CitedBy_id | crossref_primary_10_1016_j_cie_2015_07_004 crossref_primary_10_1007_s40685_019_0101_y crossref_primary_10_1016_j_ifacol_2022_09_363 crossref_primary_10_1016_j_ijpe_2022_108673 crossref_primary_10_1016_j_ifacol_2021_08_042 crossref_primary_10_1016_j_ejor_2023_10_008 crossref_primary_10_1080_00207543_2014_980014 crossref_primary_10_1016_j_cor_2019_104857 crossref_primary_10_1080_00207543_2019_1598597 crossref_primary_10_1080_00207543_2019_1587190 crossref_primary_10_1007_s10479_023_05809_1 crossref_primary_10_1371_journal_pone_0134343 crossref_primary_10_1016_j_ifacol_2016_07_864 crossref_primary_10_1016_j_cie_2024_110045 crossref_primary_10_1016_j_ijpe_2022_108661 crossref_primary_10_1080_00207543_2017_1363427 crossref_primary_10_1016_j_ejor_2023_08_046 crossref_primary_10_1016_j_ejor_2013_11_033 crossref_primary_10_1080_00207543_2020_1736723 crossref_primary_10_1080_00207543_2019_1701208 crossref_primary_10_1007_s10479_017_2711_0 crossref_primary_10_1016_j_ejor_2021_11_043 crossref_primary_10_1016_j_ejor_2023_06_007 crossref_primary_10_1016_j_ejor_2021_12_002 crossref_primary_10_1016_j_cirpj_2017_06_002 crossref_primary_10_1016_j_cie_2017_07_005 crossref_primary_10_1016_j_ejor_2015_10_048 crossref_primary_10_1080_00207543_2024_2347572 crossref_primary_10_1080_00207543_2021_1934589 crossref_primary_10_1016_j_ejor_2013_09_034 crossref_primary_10_17341_gazimmfd_514759 crossref_primary_10_1016_j_ejor_2014_06_023 crossref_primary_10_1080_00207543_2021_1998694 crossref_primary_10_1155_2018_2481435 crossref_primary_10_1016_j_cie_2022_108857 crossref_primary_10_1016_j_jer_2023_11_019 crossref_primary_10_1080_00207543_2022_2164374 crossref_primary_10_1080_00207543_2020_1823027 crossref_primary_10_1016_j_cie_2017_04_011 crossref_primary_10_1016_j_cor_2023_106359 crossref_primary_10_1080_00207543_2017_1341065 crossref_primary_10_1016_j_cor_2024_106597 crossref_primary_10_1016_j_cor_2024_106596 crossref_primary_10_1016_j_ijpe_2018_06_012 crossref_primary_10_1016_j_cie_2020_106540 crossref_primary_10_1016_j_jii_2022_100350 crossref_primary_10_1016_j_ejor_2018_03_011 crossref_primary_10_1016_j_engappai_2015_11_007 crossref_primary_10_1007_s00170_018_2971_0 crossref_primary_10_1016_j_cie_2024_110226 crossref_primary_10_1016_j_ijpe_2016_07_016 crossref_primary_10_1016_j_ijpe_2014_08_010 crossref_primary_10_1080_00207543_2021_1884767 crossref_primary_10_1007_s00500_019_04609_9 crossref_primary_10_1016_j_ejor_2017_06_017 crossref_primary_10_1016_j_ejor_2020_10_019 crossref_primary_10_1016_j_jmsy_2023_01_001 crossref_primary_10_1080_00207543_2020_1866224 crossref_primary_10_1080_00207543_2018_1427899 crossref_primary_10_1080_00207543_2017_1394599 crossref_primary_10_1016_j_ejor_2016_11_027 crossref_primary_10_1080_00207543_2022_2103749 crossref_primary_10_1108_AA_10_2021_0140 crossref_primary_10_2139_ssrn_4184983 crossref_primary_10_1016_j_ifacol_2022_09_570 crossref_primary_10_1016_j_ejor_2015_10_025 crossref_primary_10_1134_S1990478919020066 crossref_primary_10_1016_j_ijpe_2023_108873 crossref_primary_10_1080_00207543_2013_874603 crossref_primary_10_1016_j_ijpe_2024_109207 crossref_primary_10_1016_j_omega_2017_06_008 crossref_primary_10_1016_j_omega_2019_04_006 crossref_primary_10_1007_s12008_023_01423_4 crossref_primary_10_1016_j_ifacol_2020_12_2785 crossref_primary_10_1016_j_omega_2017_08_020 crossref_primary_10_1007_s11573_016_0831_7 crossref_primary_10_1016_j_jmsy_2014_08_004 crossref_primary_10_1016_j_ifacol_2019_11_630 crossref_primary_10_3390_app10041475 crossref_primary_10_1016_j_cor_2023_106451 crossref_primary_10_1016_j_cie_2018_05_048 crossref_primary_10_1016_j_cor_2018_07_001 crossref_primary_10_1080_00207543_2022_2077673 crossref_primary_10_1590_0101_7438_2015_035_01_0057 crossref_primary_10_1080_00207543_2021_1968527 crossref_primary_10_1080_00207543_2014_910618 crossref_primary_10_1016_j_ifacol_2022_09_437 crossref_primary_10_1080_00207543_2015_1115910 crossref_primary_10_1007_s11740_022_01137_8 crossref_primary_10_1016_j_jmsy_2022_02_005 crossref_primary_10_1016_j_apm_2016_12_031 crossref_primary_10_1016_j_ejor_2016_11_001 crossref_primary_10_1287_ijoc_2022_1165 crossref_primary_10_1016_j_ejor_2022_01_015 crossref_primary_10_1080_00207543_2020_1756512 crossref_primary_10_1080_00207543_2020_1818000 crossref_primary_10_1016_j_cor_2023_106323 crossref_primary_10_1016_j_ejor_2018_10_013 crossref_primary_10_1080_00207543_2022_2153185 crossref_primary_10_1016_j_omega_2022_102688 crossref_primary_10_1080_00207543_2018_1539266 crossref_primary_10_1016_j_ejor_2021_03_021 crossref_primary_10_1007_s10601_023_09351_6 crossref_primary_10_1016_j_cie_2021_107685 crossref_primary_10_1080_00207543_2020_1724344 crossref_primary_10_1016_j_cam_2022_114823 crossref_primary_10_1080_00207543_2014_937012 crossref_primary_10_1016_j_omega_2024_103092 crossref_primary_10_1016_j_cie_2017_08_030 crossref_primary_10_1080_00207543_2019_1616847 crossref_primary_10_1080_00207543_2022_2093684 crossref_primary_10_1016_j_jestch_2021_03_013 crossref_primary_10_1016_j_cie_2013_12_013 crossref_primary_10_1007_s10845_018_1398_7 crossref_primary_10_1016_j_cie_2022_108660 crossref_primary_10_1108_AA_09_2015_072 crossref_primary_10_1016_j_ifacol_2022_09_375 crossref_primary_10_1016_j_cor_2014_08_021 crossref_primary_10_1016_j_jmsy_2023_02_001 crossref_primary_10_1016_j_cie_2023_109414 crossref_primary_10_1016_j_cor_2013_12_002 crossref_primary_10_1016_j_aei_2019_101007 crossref_primary_10_1016_j_cor_2024_106605 crossref_primary_10_1080_00207543_2015_1108534 crossref_primary_10_1016_j_cor_2017_01_003 crossref_primary_10_1016_j_ijpe_2014_07_022 crossref_primary_10_1016_j_cor_2019_104863 crossref_primary_10_1080_00207543_2017_1406672 crossref_primary_10_1016_j_ifacol_2018_11_489 |
Cites_doi | 10.1287/mnsc.38.1.39 10.1016/0167-6377(86)90066-0 10.1016/j.ejor.2011.09.024 10.1007/BF01609036 10.1287/mnsc.32.8.909 10.1007/BF01588801 10.1007/s00291-006-0070-3 10.1287/ijoc.9.4.319 10.1007/s10479-009-0578-4 10.1090/dimacs/059/11 10.1016/j.ejor.2006.07.044 10.1007/BF02430364 10.1016/j.ejor.2004.07.023 10.1016/0272-6963(83)90005-0 10.1016/j.cie.2008.09.027 10.1016/j.ejor.2004.07.030 10.1016/j.ejor.2009.01.049 10.1214/ss/1009213286 10.1007/BF01416240 10.1287/mnsc.32.4.430 10.1016/j.ejor.2004.07.022 10.1016/j.ejor.2011.01.056 10.1016/j.ejor.2006.10.010 10.1080/00207549008942835 10.1126/science.1057726 10.1287/mnsc.8.1.69 10.1007/BF00127358 10.1080/00207540701713832 10.1016/j.ejor.2004.07.027 10.1016/0167-188X(90)90122-X 10.1287/mnsc.41.10.1693 10.1080/00207548108956654 10.1016/0377-2217(80)90053-3 10.1287/opre.49.6.854.10014 10.1287/mnsc.2.3.261 10.1016/j.cie.2011.02.001 10.1057/jors.1995.7 10.1016/0925-5273(95)00059-3 10.1016/S0925-5273(99)00096-1 10.1080/07408179308964335 10.1287/mnsc.16.11.728 10.1002/net.3230070302 10.1016/j.ijpe.2007.02.026 10.1057/jos.2008.18 |
ContentType | Journal Article |
Copyright | 2013 Elsevier B.V. Copyright Elsevier Sequoia S.A. Jul 1, 2013 |
Copyright_xml | – notice: 2013 Elsevier B.V. – notice: Copyright Elsevier Sequoia S.A. Jul 1, 2013 |
DBID | AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
DOI | 10.1016/j.ejor.2012.12.029 |
DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering 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 Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
DatabaseTitleList | Technology Research Database |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Computer Science Business |
EISSN | 1872-6860 |
EndPage | 45 |
ExternalDocumentID | 2922287671 10_1016_j_ejor_2012_12_029 S0377221713000039 |
Genre | Feature |
GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ AAAKG AALRI AAQXK AAXKI AAYOK AAYXX ACNNM ADIYS ADJOM ADMUD AFFNX AFJKZ AI. AKRWK ASPBG AVWKF AZFZN CITATION FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
ID | FETCH-LOGICAL-c382t-8c8bfe3747bbd1d8da497bc661a06cba43a4583faacd403d315bd49d6c98d95c3 |
ISSN | 0377-2217 |
IngestDate | Thu Oct 10 20:12:25 EDT 2024 Thu Sep 26 16:31:44 EDT 2024 Fri Feb 23 02:32:29 EST 2024 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 1 |
Keywords | Benchmark data set Precedence graph Scheduling Assembly line balancing Structure analysis Complexity measures |
Language | English |
LinkModel | OpenURL |
MergedId | FETCHMERGED-LOGICAL-c382t-8c8bfe3747bbd1d8da497bc661a06cba43a4583faacd403d315bd49d6c98d95c3 |
PQID | 1318056693 |
PQPubID | 45678 |
PageCount | 13 |
ParticipantIDs | proquest_journals_1318056693 crossref_primary_10_1016_j_ejor_2012_12_029 elsevier_sciencedirect_doi_10_1016_j_ejor_2012_12_029 |
PublicationCentury | 2000 |
PublicationDate | 2013-07-01 2013-07-00 20130701 |
PublicationDateYYYYMMDD | 2013-07-01 |
PublicationDate_xml | – month: 07 year: 2013 text: 2013-07-01 day: 01 |
PublicationDecade | 2010 |
PublicationPlace | Amsterdam |
PublicationPlace_xml | – name: Amsterdam |
PublicationTitle | European journal of operational research |
PublicationYear | 2013 |
Publisher | Elsevier B.V Elsevier Sequoia S.A |
Publisher_xml | – name: Elsevier B.V – name: Elsevier Sequoia S.A |
References | Elmaghraby, Herroelen (b0070) 1980; 5 Crowder, Dembo, Mulvey (b0055) 1978; 15 Hall, Posner (b0100) 2001; 49 Scholl, Boysen, Fliedner (b0230) 2008; 30 Hoffmann (b0105) 1990; 28 Hooker (b0115) 1995; 1 Brown, Cai, DasGupta (b0050) 2001; 16 Gunther, Johnson, Peterson (b0095) 1983; 3 Gao, Sun, Wang, Gen (b0080) 2009; 56 Garey, Johnson (b0085) 1979 Gehrlein (b0090) 1986; 5 Otto, A., Otto, C., Scholl, A., 2011. SALBPGen – A Systematic Data Generator for (simple) Assembly Line Balancing. Jena Research Papers in Business and Economics, 05/2011. Otto, Scholl (b0180) 2011; 212 Farhi (b0075) 1997; 292 Johnson, D.S., 2002. A theoretician’s guide to the experimental analysis of algorithms. In: Goldwasser, M.H., Johnson, D.S., McGeoch, C.C. (Eds.), Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 59. Jackson, Boggs, Nash, Powell (b0125) 1991; 49 Kilincci (b0145) 2011; 60 Baldwin, Clark (b0015) 1997; 75 Tamhane, Dunlop (b0260) 2000 Rosenberg, Ziegler (b0200) 1992; 36 Bhattacharjee, Sahu (b0030) 1990; 18 Wee, T.S., Magazine, M.J., 1981. An Efficient Branch and Bound Algorithm for Assembly Line Balancing – Part I: Minimize the Number of Work Stations. Working Paper No. 150. University of Waterloo, Waterloo. Mastor (b0175) 1970; 16 Scholl, A., 1993. Data of Assembly Line Balancing Problems. Schriften zur Quantitativen Betriebswirtschaftslehre, 16/1993, TH Darmstadt. Boysen, Fliedner, Scholl (b0045) 2008; 111 Dar-El (Mansoor) (b0060) 1975; 7 Downey, A.B., 2011. Think Stats: Probability and Statistics for Programmers. O’Reilly Media: Sebastopol. Boctor (b0035) 1995; 46 Boysen, Fliedner, Scholl (b0040) 2007; 183 Urban, Chiang (b0270) 2006; 168 Scholl, Boysen, Fliedner (b0235) 2009; 172 Andrés, Miralles, Pastor (b0010) 2008; 187 Amen (b0005) 2001; 69 Lee, Bard, Pinedo, Wilhelm (b0160) 2007; 25 Kilbridge, Wester (b0140) 1961; 8 Scholl, Becker (b0220) 2006; 168 Talbot, Patterson, Gehrlein (b0255) 1986; 32 Scholl, Voß (b0245) 1997; 2 Scholl, Fliedner, Boysen (b0240) 2010; 200 Jackson (b0120) 1956; 2 Hoffmann (b0110) 1992; 38 Thesen (b0265) 1977; 7 Becker, Scholl (b0025) 2006; 168 Klindworth, Otto., Scholl (b0150) 2012; 217 Longo, Mirabelli (b0170) 2009; 3 Rubinovitz, Levitin (b0205) 1995; 41 Johnson (b0130) 1981; 19 Levitin, Rubinovitz, Shnits (b0165) 2006; 168 Otto, A., Otto, C., Scholl, A., 2012. How to Design and Analyze Priority Rules: Example of Simple Assembly Line Balancing. Working Papers in Supply Chain Management, 03/2012, University of Jena. Schwindt, C., 1998. Generation of Resource-Constrained Project Scheduling Problems Subject to temporal constraints. Report WIOR – 543. Karlsruhe University. Kolisch, Sprecher, Drexl (b0155) 1995; 41 Scholl (b0215) 1999 Pastor, Ferrer (b0195) 2009; 27 Scholl, Klein (b0225) 1997; 9 Baybars (b0020) 1986; 32 Gunther (10.1016/j.ejor.2012.12.029_b0095) 1983; 3 Garey (10.1016/j.ejor.2012.12.029_b0085) 1979 Tamhane (10.1016/j.ejor.2012.12.029_b0260) 2000 10.1016/j.ejor.2012.12.029_b0065 10.1016/j.ejor.2012.12.029_b0185 Scholl (10.1016/j.ejor.2012.12.029_b0235) 2009; 172 Baybars (10.1016/j.ejor.2012.12.029_b0020) 1986; 32 Hoffmann (10.1016/j.ejor.2012.12.029_b0110) 1992; 38 Klindworth (10.1016/j.ejor.2012.12.029_b0150) 2012; 217 Amen (10.1016/j.ejor.2012.12.029_b0005) 2001; 69 Rubinovitz (10.1016/j.ejor.2012.12.029_b0205) 1995; 41 Otto (10.1016/j.ejor.2012.12.029_b0180) 2011; 212 Johnson (10.1016/j.ejor.2012.12.029_b0130) 1981; 19 Hooker (10.1016/j.ejor.2012.12.029_b0115) 1995; 1 Jackson (10.1016/j.ejor.2012.12.029_b0120) 1956; 2 Boysen (10.1016/j.ejor.2012.12.029_b0040) 2007; 183 Elmaghraby (10.1016/j.ejor.2012.12.029_b0070) 1980; 5 10.1016/j.ejor.2012.12.029_b0250 Jackson (10.1016/j.ejor.2012.12.029_b0125) 1991; 49 Baldwin (10.1016/j.ejor.2012.12.029_b0015) 1997; 75 10.1016/j.ejor.2012.12.029_b0210 Hall (10.1016/j.ejor.2012.12.029_b0100) 2001; 49 Scholl (10.1016/j.ejor.2012.12.029_b0245) 1997; 2 Thesen (10.1016/j.ejor.2012.12.029_b0265) 1977; 7 10.1016/j.ejor.2012.12.029_b0135 Mastor (10.1016/j.ejor.2012.12.029_b0175) 1970; 16 Brown (10.1016/j.ejor.2012.12.029_b0050) 2001; 16 Gehrlein (10.1016/j.ejor.2012.12.029_b0090) 1986; 5 Boctor (10.1016/j.ejor.2012.12.029_b0035) 1995; 46 Dar-El (Mansoor) (10.1016/j.ejor.2012.12.029_b0060) 1975; 7 Lee (10.1016/j.ejor.2012.12.029_b0160) 2007; 25 Crowder (10.1016/j.ejor.2012.12.029_b0055) 1978; 15 Levitin (10.1016/j.ejor.2012.12.029_b0165) 2006; 168 Andrés (10.1016/j.ejor.2012.12.029_b0010) 2008; 187 Scholl (10.1016/j.ejor.2012.12.029_b0220) 2006; 168 Kilbridge (10.1016/j.ejor.2012.12.029_b0140) 1961; 8 Kilincci (10.1016/j.ejor.2012.12.029_b0145) 2011; 60 Talbot (10.1016/j.ejor.2012.12.029_b0255) 1986; 32 Kolisch (10.1016/j.ejor.2012.12.029_b0155) 1995; 41 Scholl (10.1016/j.ejor.2012.12.029_b0230) 2008; 30 Bhattacharjee (10.1016/j.ejor.2012.12.029_b0030) 1990; 18 Becker (10.1016/j.ejor.2012.12.029_b0025) 2006; 168 Gao (10.1016/j.ejor.2012.12.029_b0080) 2009; 56 Urban (10.1016/j.ejor.2012.12.029_b0270) 2006; 168 Hoffmann (10.1016/j.ejor.2012.12.029_b0105) 1990; 28 Longo (10.1016/j.ejor.2012.12.029_b0170) 2009; 3 Scholl (10.1016/j.ejor.2012.12.029_b0215) 1999 10.1016/j.ejor.2012.12.029_b0275 Boysen (10.1016/j.ejor.2012.12.029_b0045) 2008; 111 Pastor (10.1016/j.ejor.2012.12.029_b0195) 2009; 27 Farhi (10.1016/j.ejor.2012.12.029_b0075) 1997; 292 Scholl (10.1016/j.ejor.2012.12.029_b0225) 1997; 9 Scholl (10.1016/j.ejor.2012.12.029_b0240) 2010; 200 Rosenberg (10.1016/j.ejor.2012.12.029_b0200) 1992; 36 10.1016/j.ejor.2012.12.029_b0190 |
References_xml | – volume: 8 start-page: 69 year: 1961 end-page: 84 ident: b0140 article-title: The balance delay problem publication-title: Management Science contributor: fullname: Wester – volume: 3 start-page: 50 year: 2009 end-page: 60 ident: b0170 article-title: Effective design of an assembly line using modeling and simulation publication-title: Journal of Simulation contributor: fullname: Mirabelli – volume: 38 start-page: 39 year: 1992 end-page: 46 ident: b0110 article-title: EUREKA – a hybrid system for assembly line balancing publication-title: Management Science contributor: fullname: Hoffmann – volume: 168 start-page: 811 year: 2006 end-page: 825 ident: b0165 article-title: A genetic algorithm for robotic assembly line balancing publication-title: European Journal of Operational Research contributor: fullname: Shnits – volume: 49 start-page: 854 year: 2001 end-page: 865 ident: b0100 article-title: Generating experimental data for computational testing with machine scheduling applications publication-title: Operations Research contributor: fullname: Posner – volume: 25 start-page: 121 year: 2007 end-page: 123 ident: b0160 article-title: Guidelines for reporting computational results in IIE Transactions publication-title: IIE Transactions contributor: fullname: Wilhelm – volume: 5 start-page: 285 year: 1986 end-page: 291 ident: b0090 article-title: On methods for generating random partial orders publication-title: Operations Research Letters contributor: fullname: Gehrlein – volume: 292 start-page: 472 year: 1997 end-page: 475 ident: b0075 article-title: A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem publication-title: Science contributor: fullname: Farhi – volume: 5 start-page: 223 year: 1980 end-page: 234 ident: b0070 article-title: On the measurement of complexity in activity networks publication-title: European Journal of Operational Research contributor: fullname: Herroelen – volume: 36 start-page: 477 year: 1992 end-page: 495 ident: b0200 article-title: A comparison of heuristic algorithms for cost-oriented assembly line balancing publication-title: ZOR – Methods and Models of Operations Research contributor: fullname: Ziegler – volume: 212 start-page: 277 year: 2011 end-page: 286 ident: b0180 article-title: Incorporating ergonomic risks into assembly line balancing publication-title: European Journal of Operational Research contributor: fullname: Scholl – volume: 172 start-page: 243 year: 2009 end-page: 258 ident: b0235 article-title: Optimally solving the alternative subgraphs assembly line balancing problem publication-title: Annals of Operations Research contributor: fullname: Fliedner – volume: 1 start-page: 33 year: 1995 end-page: 42 ident: b0115 article-title: Testing heuristics: we have it all wrong publication-title: Journal of Heuristics contributor: fullname: Hooker – volume: 183 start-page: 674 year: 2007 end-page: 693 ident: b0040 article-title: A classification of assembly line balancing problems publication-title: European Journal of Operational Research contributor: fullname: Scholl – volume: 28 start-page: 1807 year: 1990 end-page: 1815 ident: b0105 article-title: Assembly line balancing: a set of challenging problems publication-title: International Journal of Production Research contributor: fullname: Hoffmann – volume: 69 start-page: 255 year: 2001 end-page: 264 ident: b0005 article-title: Heuristic methods for cost-oriented assembly line balancing: a comparison on solution quality and computing time publication-title: International Journal of Production Research contributor: fullname: Amen – volume: 41 start-page: 343 year: 1995 end-page: 354 ident: b0205 article-title: Genetic algorithm for assembly line balancing publication-title: International Journal of Production Economics contributor: fullname: Levitin – volume: 2 start-page: 261 year: 1956 end-page: 271 ident: b0120 article-title: A computing procedure for a line balancing problem publication-title: Management Science contributor: fullname: Jackson – volume: 217 start-page: 259 year: 2012 end-page: 269 ident: b0150 article-title: On the learning precedence graph concept for the automotive industry publication-title: European Journal of Operational Research contributor: fullname: Scholl – volume: 3 start-page: 209 year: 1983 end-page: 221 ident: b0095 article-title: Currently practiced formulations for the assembly line balance problem publication-title: Journal of Operations Management contributor: fullname: Peterson – volume: 49 start-page: 413 year: 1991 end-page: 425 ident: b0125 article-title: Guidelines for reporting results of computational experiments. Report of the ad hoc committee publication-title: Mathematical Programming contributor: fullname: Powell – volume: 16 start-page: 728 year: 1970 end-page: 746 ident: b0175 article-title: An experimental investigation and comparative evaluation of production line balancing techniques publication-title: Management Science contributor: fullname: Mastor – volume: 19 start-page: 277 year: 1981 end-page: 287 ident: b0130 article-title: Assembly line balancing algorithms: computational comparisons publication-title: International Journal of Production Research contributor: fullname: Johnson – volume: 18 start-page: 203 year: 1990 end-page: 214 ident: b0030 article-title: Complexity of single model assembly line balancing problems publication-title: Engineering Costs and Production Economics contributor: fullname: Sahu – volume: 9 start-page: 319 year: 1997 end-page: 334 ident: b0225 article-title: SALOME: a bidirectional branch and bound procedure for assembly line balancing publication-title: INFORMS Journal on Computing contributor: fullname: Klein – volume: 56 start-page: 1065 year: 2009 end-page: 1080 ident: b0080 article-title: An efficient approach for type II robotic assembly line balancing problems publication-title: Computers & Industrial Engineering contributor: fullname: Gen – volume: 27 start-page: 2943 year: 2009 end-page: 2959 ident: b0195 article-title: An improved mathematical program to solve the simple assembly line balancing problem publication-title: International Journal of Production Research contributor: fullname: Ferrer – volume: 7 start-page: 193 year: 1977 end-page: 208 ident: b0265 article-title: Measures of the restrictiveness of project networks publication-title: Networks contributor: fullname: Thesen – year: 1979 ident: b0085 article-title: Computers and Intractability contributor: fullname: Johnson – volume: 32 start-page: 430 year: 1986 end-page: 454 ident: b0255 article-title: A comparative evaluation of heuristic line balancing techniques publication-title: Management Science contributor: fullname: Gehrlein – volume: 168 start-page: 771 year: 2006 end-page: 782 ident: b0270 article-title: An optimal piecewise-linear program for the U-line balancing problem with stochastic task times publication-title: European Journal of Operational Research contributor: fullname: Chiang – volume: 168 start-page: 694 year: 2006 end-page: 715 ident: b0025 article-title: A survey on problems and methods in generalized assembly line balancing publication-title: European Journal of Operational Research contributor: fullname: Scholl – volume: 200 start-page: 688 year: 2010 end-page: 701 ident: b0240 article-title: Absalom: balancing assembly lines with assignment restrictions publication-title: European Journal of Operational Research contributor: fullname: Boysen – year: 1999 ident: b0215 article-title: Balancing and Sequencing Assembly Lines contributor: fullname: Scholl – volume: 46 start-page: 62 year: 1995 end-page: 69 ident: b0035 article-title: A multiple-rule heuristic for assembly line balancing publication-title: Journal of the Operational Research Society contributor: fullname: Boctor – volume: 30 start-page: 579 year: 2008 end-page: 609 ident: b0230 article-title: The sequence-dependent assembly line balancing problem publication-title: Operations Research Spectrum contributor: fullname: Fliedner – volume: 16 start-page: 101 year: 2001 end-page: 133 ident: b0050 article-title: Interval estimation for a binomial proportion publication-title: Statistical Science contributor: fullname: DasGupta – volume: 32 start-page: 909 year: 1986 end-page: 932 ident: b0020 article-title: A survey of exact algorithms for the simple assembly line balancing problem publication-title: Management Science contributor: fullname: Baybars – volume: 168 start-page: 666 year: 2006 end-page: 693 ident: b0220 article-title: State-of-the-art exact and heuristic solution procedures for simple assembly line balancing publication-title: European Journal of Operational Research contributor: fullname: Becker – volume: 75 start-page: 84 year: 1997 end-page: 93 ident: b0015 article-title: Managing in the age of modularity publication-title: Harvard Business Review contributor: fullname: Clark – volume: 15 start-page: 316 year: 1978 end-page: 329 ident: b0055 article-title: Reporting computational experiments in mathematical programming publication-title: Mathematical Programming contributor: fullname: Mulvey – volume: 41 start-page: 1693 year: 1995 end-page: 1703 ident: b0155 article-title: Characterization and generation of a general class of resource-constrained project scheduling problems publication-title: Management Science contributor: fullname: Drexl – volume: 2 start-page: 217 year: 1997 end-page: 244 ident: b0245 article-title: Simple assembly line balancing – heuristic approaches publication-title: Journal of Heuristics contributor: fullname: Voß – year: 2000 ident: b0260 article-title: Statistics and Data Analysis: From Elementary to Intermediate contributor: fullname: Dunlop – volume: 7 start-page: 302 year: 1975 end-page: 310 ident: b0060 article-title: Solving large single-model assembly line balancing problems – a comparative study publication-title: IIE Transactions contributor: fullname: Dar-El (Mansoor) – volume: 60 start-page: 830 year: 2011 end-page: 839 ident: b0145 article-title: Firing sequences backward algorithm for simple assembly line balancing problem of type 1 publication-title: Computers & Industrial Engineering contributor: fullname: Kilincci – volume: 111 start-page: 509 year: 2008 end-page: 528 ident: b0045 article-title: Assembly line balancing: which model to use when? publication-title: International Journal of Production Economics contributor: fullname: Scholl – volume: 187 start-page: 1212 year: 2008 end-page: 1223 ident: b0010 article-title: Balancing and scheduling tasks in assembly lines with sequence-dependent setup times publication-title: European Journal of Operational Research contributor: fullname: Pastor – volume: 38 start-page: 39 year: 1992 ident: 10.1016/j.ejor.2012.12.029_b0110 article-title: EUREKA – a hybrid system for assembly line balancing publication-title: Management Science doi: 10.1287/mnsc.38.1.39 contributor: fullname: Hoffmann – volume: 5 start-page: 285 year: 1986 ident: 10.1016/j.ejor.2012.12.029_b0090 article-title: On methods for generating random partial orders publication-title: Operations Research Letters doi: 10.1016/0167-6377(86)90066-0 contributor: fullname: Gehrlein – volume: 217 start-page: 259 year: 2012 ident: 10.1016/j.ejor.2012.12.029_b0150 article-title: On the learning precedence graph concept for the automotive industry publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2011.09.024 contributor: fullname: Klindworth – volume: 7 start-page: 302 year: 1975 ident: 10.1016/j.ejor.2012.12.029_b0060 article-title: Solving large single-model assembly line balancing problems – a comparative study publication-title: IIE Transactions contributor: fullname: Dar-El (Mansoor) – volume: 15 start-page: 316 year: 1978 ident: 10.1016/j.ejor.2012.12.029_b0055 article-title: Reporting computational experiments in mathematical programming publication-title: Mathematical Programming doi: 10.1007/BF01609036 contributor: fullname: Crowder – volume: 32 start-page: 909 year: 1986 ident: 10.1016/j.ejor.2012.12.029_b0020 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 contributor: fullname: Baybars – ident: 10.1016/j.ejor.2012.12.029_b0065 – volume: 49 start-page: 413 year: 1991 ident: 10.1016/j.ejor.2012.12.029_b0125 article-title: Guidelines for reporting results of computational experiments. Report of the ad hoc committee publication-title: Mathematical Programming doi: 10.1007/BF01588801 contributor: fullname: Jackson – volume: 30 start-page: 579 year: 2008 ident: 10.1016/j.ejor.2012.12.029_b0230 article-title: The sequence-dependent assembly line balancing problem publication-title: Operations Research Spectrum doi: 10.1007/s00291-006-0070-3 contributor: fullname: Scholl – volume: 9 start-page: 319 year: 1997 ident: 10.1016/j.ejor.2012.12.029_b0225 article-title: SALOME: a bidirectional branch and bound procedure for assembly line balancing publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.9.4.319 contributor: fullname: Scholl – year: 2000 ident: 10.1016/j.ejor.2012.12.029_b0260 contributor: fullname: Tamhane – ident: 10.1016/j.ejor.2012.12.029_b0250 – volume: 172 start-page: 243 year: 2009 ident: 10.1016/j.ejor.2012.12.029_b0235 article-title: Optimally solving the alternative subgraphs assembly line balancing problem publication-title: Annals of Operations Research doi: 10.1007/s10479-009-0578-4 contributor: fullname: Scholl – ident: 10.1016/j.ejor.2012.12.029_b0135 doi: 10.1090/dimacs/059/11 – volume: 187 start-page: 1212 year: 2008 ident: 10.1016/j.ejor.2012.12.029_b0010 article-title: Balancing and scheduling tasks in assembly lines with sequence-dependent setup times publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.07.044 contributor: fullname: Andrés – volume: 1 start-page: 33 year: 1995 ident: 10.1016/j.ejor.2012.12.029_b0115 article-title: Testing heuristics: we have it all wrong publication-title: Journal of Heuristics doi: 10.1007/BF02430364 contributor: fullname: Hooker – volume: 168 start-page: 694 year: 2006 ident: 10.1016/j.ejor.2012.12.029_b0025 article-title: A survey on problems and methods in generalized assembly line balancing publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.023 contributor: fullname: Becker – volume: 3 start-page: 209 year: 1983 ident: 10.1016/j.ejor.2012.12.029_b0095 article-title: Currently practiced formulations for the assembly line balance problem publication-title: Journal of Operations Management doi: 10.1016/0272-6963(83)90005-0 contributor: fullname: Gunther – volume: 56 start-page: 1065 year: 2009 ident: 10.1016/j.ejor.2012.12.029_b0080 article-title: An efficient approach for type II robotic assembly line balancing problems publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2008.09.027 contributor: fullname: Gao – volume: 168 start-page: 811 year: 2006 ident: 10.1016/j.ejor.2012.12.029_b0165 article-title: A genetic algorithm for robotic assembly line balancing publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.030 contributor: fullname: Levitin – volume: 200 start-page: 688 year: 2010 ident: 10.1016/j.ejor.2012.12.029_b0240 article-title: Absalom: balancing assembly lines with assignment restrictions publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.01.049 contributor: fullname: Scholl – volume: 16 start-page: 101 year: 2001 ident: 10.1016/j.ejor.2012.12.029_b0050 article-title: Interval estimation for a binomial proportion publication-title: Statistical Science doi: 10.1214/ss/1009213286 contributor: fullname: Brown – volume: 36 start-page: 477 year: 1992 ident: 10.1016/j.ejor.2012.12.029_b0200 article-title: A comparison of heuristic algorithms for cost-oriented assembly line balancing publication-title: ZOR – Methods and Models of Operations Research doi: 10.1007/BF01416240 contributor: fullname: Rosenberg – volume: 32 start-page: 430 year: 1986 ident: 10.1016/j.ejor.2012.12.029_b0255 article-title: A comparative evaluation of heuristic line balancing techniques publication-title: Management Science doi: 10.1287/mnsc.32.4.430 contributor: fullname: Talbot – volume: 168 start-page: 666 year: 2006 ident: 10.1016/j.ejor.2012.12.029_b0220 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 contributor: fullname: Scholl – ident: 10.1016/j.ejor.2012.12.029_b0190 – year: 1979 ident: 10.1016/j.ejor.2012.12.029_b0085 contributor: fullname: Garey – volume: 212 start-page: 277 year: 2011 ident: 10.1016/j.ejor.2012.12.029_b0180 article-title: Incorporating ergonomic risks into assembly line balancing publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2011.01.056 contributor: fullname: Otto – volume: 183 start-page: 674 year: 2007 ident: 10.1016/j.ejor.2012.12.029_b0040 article-title: A classification of assembly line balancing problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.10.010 contributor: fullname: Boysen – volume: 28 start-page: 1807 year: 1990 ident: 10.1016/j.ejor.2012.12.029_b0105 article-title: Assembly line balancing: a set of challenging problems publication-title: International Journal of Production Research doi: 10.1080/00207549008942835 contributor: fullname: Hoffmann – volume: 292 start-page: 472 year: 1997 ident: 10.1016/j.ejor.2012.12.029_b0075 article-title: A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem publication-title: Science doi: 10.1126/science.1057726 contributor: fullname: Farhi – volume: 8 start-page: 69 year: 1961 ident: 10.1016/j.ejor.2012.12.029_b0140 article-title: The balance delay problem publication-title: Management Science doi: 10.1287/mnsc.8.1.69 contributor: fullname: Kilbridge – year: 1999 ident: 10.1016/j.ejor.2012.12.029_b0215 contributor: fullname: Scholl – volume: 2 start-page: 217 year: 1997 ident: 10.1016/j.ejor.2012.12.029_b0245 article-title: Simple assembly line balancing – heuristic approaches publication-title: Journal of Heuristics doi: 10.1007/BF00127358 contributor: fullname: Scholl – volume: 27 start-page: 2943 year: 2009 ident: 10.1016/j.ejor.2012.12.029_b0195 article-title: An improved mathematical program to solve the simple assembly line balancing problem publication-title: International Journal of Production Research doi: 10.1080/00207540701713832 contributor: fullname: Pastor – volume: 168 start-page: 771 year: 2006 ident: 10.1016/j.ejor.2012.12.029_b0270 article-title: An optimal piecewise-linear program for the U-line balancing problem with stochastic task times publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.027 contributor: fullname: Urban – volume: 18 start-page: 203 year: 1990 ident: 10.1016/j.ejor.2012.12.029_b0030 article-title: Complexity of single model assembly line balancing problems publication-title: Engineering Costs and Production Economics doi: 10.1016/0167-188X(90)90122-X contributor: fullname: Bhattacharjee – ident: 10.1016/j.ejor.2012.12.029_b0275 – volume: 41 start-page: 1693 year: 1995 ident: 10.1016/j.ejor.2012.12.029_b0155 article-title: Characterization and generation of a general class of resource-constrained project scheduling problems publication-title: Management Science doi: 10.1287/mnsc.41.10.1693 contributor: fullname: Kolisch – ident: 10.1016/j.ejor.2012.12.029_b0210 – volume: 19 start-page: 277 year: 1981 ident: 10.1016/j.ejor.2012.12.029_b0130 article-title: Assembly line balancing algorithms: computational comparisons publication-title: International Journal of Production Research doi: 10.1080/00207548108956654 contributor: fullname: Johnson – volume: 5 start-page: 223 year: 1980 ident: 10.1016/j.ejor.2012.12.029_b0070 article-title: On the measurement of complexity in activity networks publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(80)90053-3 contributor: fullname: Elmaghraby – volume: 49 start-page: 854 year: 2001 ident: 10.1016/j.ejor.2012.12.029_b0100 article-title: Generating experimental data for computational testing with machine scheduling applications publication-title: Operations Research doi: 10.1287/opre.49.6.854.10014 contributor: fullname: Hall – volume: 2 start-page: 261 year: 1956 ident: 10.1016/j.ejor.2012.12.029_b0120 article-title: A computing procedure for a line balancing problem publication-title: Management Science doi: 10.1287/mnsc.2.3.261 contributor: fullname: Jackson – volume: 75 start-page: 84 year: 1997 ident: 10.1016/j.ejor.2012.12.029_b0015 article-title: Managing in the age of modularity publication-title: Harvard Business Review contributor: fullname: Baldwin – ident: 10.1016/j.ejor.2012.12.029_b0185 – volume: 60 start-page: 830 year: 2011 ident: 10.1016/j.ejor.2012.12.029_b0145 article-title: Firing sequences backward algorithm for simple assembly line balancing problem of type 1 publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2011.02.001 contributor: fullname: Kilincci – volume: 46 start-page: 62 year: 1995 ident: 10.1016/j.ejor.2012.12.029_b0035 article-title: A multiple-rule heuristic for assembly line balancing publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1995.7 contributor: fullname: Boctor – volume: 41 start-page: 343 year: 1995 ident: 10.1016/j.ejor.2012.12.029_b0205 article-title: Genetic algorithm for assembly line balancing publication-title: International Journal of Production Economics doi: 10.1016/0925-5273(95)00059-3 contributor: fullname: Rubinovitz – volume: 69 start-page: 255 year: 2001 ident: 10.1016/j.ejor.2012.12.029_b0005 article-title: Heuristic methods for cost-oriented assembly line balancing: a comparison on solution quality and computing time publication-title: International Journal of Production Research doi: 10.1016/S0925-5273(99)00096-1 contributor: fullname: Amen – volume: 25 start-page: 121 year: 2007 ident: 10.1016/j.ejor.2012.12.029_b0160 article-title: Guidelines for reporting computational results in IIE Transactions publication-title: IIE Transactions doi: 10.1080/07408179308964335 contributor: fullname: Lee – volume: 16 start-page: 728 year: 1970 ident: 10.1016/j.ejor.2012.12.029_b0175 article-title: An experimental investigation and comparative evaluation of production line balancing techniques publication-title: Management Science doi: 10.1287/mnsc.16.11.728 contributor: fullname: Mastor – volume: 7 start-page: 193 year: 1977 ident: 10.1016/j.ejor.2012.12.029_b0265 article-title: Measures of the restrictiveness of project networks publication-title: Networks doi: 10.1002/net.3230070302 contributor: fullname: Thesen – volume: 111 start-page: 509 year: 2008 ident: 10.1016/j.ejor.2012.12.029_b0045 article-title: Assembly line balancing: which model to use when? publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2007.02.026 contributor: fullname: Boysen – volume: 3 start-page: 50 year: 2009 ident: 10.1016/j.ejor.2012.12.029_b0170 article-title: Effective design of an assembly line using modeling and simulation publication-title: Journal of Simulation doi: 10.1057/jos.2008.18 contributor: fullname: Longo |
SSID | ssj0001515 |
Score | 2.515776 |
Snippet | ► Guidelines for systematic testing of algorithm’s performance. ► New generator for realistic and diversified line balancing instances. ► Analysis and new... Recently, the importance of correctly designed computational experiments for testing algorithms has been a subject of extended discussions. Whenever real-world... |
SourceID | proquest crossref elsevier |
SourceType | Aggregation Database Publisher |
StartPage | 33 |
SubjectTerms | Algorithms Assembly line balancing Assembly lines Benchmark data set Complexity measures Datasets Experiments Generators Graph theory Heuristic Manufacturing Precedence graph Scheduling Structure analysis Studies |
Title | Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing |
URI | https://dx.doi.org/10.1016/j.ejor.2012.12.029 https://www.proquest.com/docview/1318056693 |
Volume | 228 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLa6TULwwKWAGAzkB96iTI3jJs5jgcJACJA6pL1ZvgWotnTqMmn795wT201pAQESUhW1lpKm_b74fD4-F0KeZwpEfM14mhWuSDkfmVQX6IO3tStVZV01wmzko1n54US8mvLpYBC7ZPVj_xVpGAOsMXP2L9BeXRQG4D1gDkdAHY5_hPusL82M0Z_YItkFlLtgSbACie3CNroIw3gziTr9slh-a7-exf2DxF0pLB3cpbVM3r_49Mb5U0BuuzN9ep10ClVjbKSJBvBnPv6gd2FgGT2PocTQyhX9sW1juk2jNgd9_YM1GmPlUL9bgjRt1h0X2ESiXHdcbGfU-CyuskwZ8_mch85PyqJkaSF834E4azMmtujp52BfWCNYc1-rcstOeJfF_NDNF1gUNmOdTzj4Xn6svz3DW8I7wo0_TGXeIXsMZjWYVPcmb6cn71aGH7Vht2kVfkLI0fLhhJvf9CsdtKEIOplzfJfcDusTOvHEukcGrhmSGzE9YkjuxDYgNFiFIbm1VtPyPrnuCUiRgLQnIAUCUiQg9QSkwCYaCUh7AlL4BASkgYB0UdNIwO6USECKBKQrAj4gn19Pj18epaG_R2pywdpUGKFrl8OCVmubWWEVr0ptQDGqUWG04rnCXf1aKWP5KLd5NtaWV7YwlbDV2OQPyW6zaNwjQisrHKhPA9ZHYEMIoXQmOKtrpV1urNgnSfy35bkv4yJjfONcIjYSsZHwAmz2yTgCIoMQ9QJTAn9-e95BRE-G5-tCZmA1YZVRVPnjf7zsE3Kzf34OyG67vHRPyc6FvXwWKPgdaGC57Q |
link.rule.ids | 315,782,786,27933,27934 |
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=Systematic+data+generation+and+test+design+for+solution+algorithms+on+the+example+of+SALBPGen+for+assembly+line+balancing&rft.jtitle=European+journal+of+operational+research&rft.au=Otto%2C+Alena&rft.au=Otto%2C+Christian&rft.au=Scholl%2C+Armin&rft.date=2013-07-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=228&rft.issue=1&rft.spage=33&rft.epage=45&rft_id=info:doi/10.1016%2Fj.ejor.2012.12.029&rft.externalDocID=S0377221713000039 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |