메뉴 건너뛰기




Volumn 69, Issue 1, 2014, Pages 43-52

How to design effective priority rules: Example of simple assembly line balancing

Author keywords

Assembly line balancing; Combinatorial optimization; Heuristics; Manufacturing; Priority rules

Indexed keywords

ASSEMBLY LINE BALANCING; COMPUTATIONAL INVESTIGATION; DATA MINING ALGORITHM; HEURISTICS; OPTIMIZATION PROBLEMS; PRIORITY RULES; PROBLEM-SPECIFIC KNOWLEDGE; SIMPLE ASSEMBLY LINE BALANCING;

EID: 84892969974     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2013.12.013     Document Type: Article
Times cited : (47)

References (47)
  • 1
    • 36849023499 scopus 로고    scopus 로고
    • Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
    • DOI 10.1016/j.ejor.2006.07.044, PII S0377221706008320
    • C. Andrés, C. Miralles, and R. Pastor Balancing and scheduling tasks in assembly lines with sequence-dependent setup times European Journal of Operational Research 187 2008 1212 1223 (Pubitemid 350236632)
    • (2008) European Journal of Operational Research , vol.187 , Issue.3 , pp. 1212-1223
    • Andres, C.1    Miralles, C.2    Pastor, R.3
  • 2
    • 40849130689 scopus 로고
    • COMSOAL: A computer method of sequencing operations for assembly lines
    • A.L. Arcus COMSOAL: A computer method of sequencing operations for assembly lines International Journal of Production Research 4 1966 259 277
    • (1966) International Journal of Production Research , vol.4 , pp. 259-277
    • Arcus, A.L.1
  • 4
    • 55149094562 scopus 로고    scopus 로고
    • A dynamic programming based heuristic for the assembly line balancing problem
    • J. Bautista, and J. Pereira A dynamic programming based heuristic for the assembly line balancing problem European Journal of Operational Research 194 2009 787 794
    • (2009) European Journal of Operational Research , vol.194 , pp. 787-794
    • Bautista, J.1    Pereira, J.2
  • 5
    • 0022768294 scopus 로고
    • Survey of exact algorithms for the simple assembly line balancing problem
    • I. Baybars A survey of exact algorithms for the assembly line balancing problem Management Science 32 1986 909 932 (Pubitemid 16612186)
    • (1986) Management Science , vol.32 , Issue.8 , pp. 909-932
    • Baybars Ilker1
  • 6
    • 25144450992 scopus 로고    scopus 로고
    • A survey on problems and methods in generalized assembly line balancing
    • DOI 10.1016/j.ejor.2004.07.023, PII S0377221704004801, Balancing Assembly and Transfer Lines
    • C. Becker, and A. Scholl A survey on problems and methods in generalized assembly line balancing European Journal of Operational Research 168 2006 694 715 (Pubitemid 41336587)
    • (2006) European Journal of Operational Research , vol.168 , Issue.3 , pp. 694-715
    • Becker, C.1    Scholl, A.2
  • 7
    • 0016962509 scopus 로고
    • A trainable heuristic procedure for the assembly line balancing problem
    • G.B. Bennett, and J. Byrd A trainable heuristic procedure for the assembly line balancing problem AIIE Transactions 8 1976 195 201
    • (1976) AIIE Transactions , vol.8 , pp. 195-201
    • Bennett, G.B.1    Byrd, J.2
  • 11
    • 0032009271 scopus 로고    scopus 로고
    • Initialization strategies and diversity in evolutionary timetabling
    • E.K. Burke, J.P. Newall, and R.F. Weare Initialization strategies and diversity in evolutionary timetabling Evolutionary Computation 6 1998 81 103 (Pubitemid 128692723)
    • (1998) Evolutionary Computation , vol.6 , Issue.1 , pp. 81-103
    • Burke, E.K.1    Weare, R.F.2    Newall, J.P.3
  • 12
    • 44649128530 scopus 로고    scopus 로고
    • A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling
    • H. Chtourou, and M. Haouari A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling Computers & Industrial Engineering 55 2008 183 194
    • (2008) Computers & Industrial Engineering , vol.55 , pp. 183-194
    • Chtourou, H.1    Haouari, M.2
  • 13
    • 0029215084 scopus 로고
    • Evolution based learning in a job shop scheduling environment
    • U. Dorndorf, and E. Pesch Evolution based learning in a job shop scheduling environment Computers & Operations Research 22 1995 25 40
    • (1995) Computers & Operations Research , vol.22 , pp. 25-40
    • Dorndorf, U.1    Pesch, E.2
  • 16
    • 0024765174 scopus 로고
    • Fast, effective algorithms for simple assembly line balancing problems
    • S.T. Hackman, M.J. Magazine, and T.S. Wee Fast, effective algorithms for simple assembly line balancing problems Operations Research 37 1989 916 924 (Pubitemid 20625070)
    • (1989) Operations Research , vol.37 , Issue.6 , pp. 916-924
    • Hackman Steven, T.1    Magazine Michael, J.2    Wee, T.S.3
  • 17
    • 34249973653 scopus 로고
    • A survey of priority rule-based scheduling
    • R. Haupt A survey of priority rule-based scheduling Operations-Research- Spektrum 11 1989 3 16
    • (1989) Operations-Research-Spektrum , vol.11 , pp. 3-16
    • Haupt, R.1
  • 18
    • 0001108060 scopus 로고
    • Assembly line balancing using the ranked positional weight technique
    • W.B. Helgeson, and D.P. Birnie Assembly line balancing using the ranked positional weight technique Journal of Industrial Engineering 12 1961 394 398
    • (1961) Journal of Industrial Engineering , vol.12 , pp. 394-398
    • Helgeson, W.B.1    Birnie, D.P.2
  • 19
    • 0000658024 scopus 로고
    • Search and simulation selection of a job-shop sequencing rule
    • J.C. Hershauer, and R.J. Ebert Search and simulation selection of a job-shop sequencing rule Management Science 21 1975 833 843
    • (1975) Management Science , vol.21 , pp. 833-843
    • Hershauer, J.C.1    Ebert, R.J.2
  • 20
    • 0031246589 scopus 로고    scopus 로고
    • Design of efficient job shop scheduling rules
    • PII S0360835297000855
    • O. Holthaus Design of efficient job shop scheduling rules Computers & Industrial Engineering 33 1997 249 252 (Pubitemid 127404362)
    • (1997) Computers and Industrial Engineering , vol.33 , Issue.1-2 , pp. 249-252
    • Holthaus, O.1
  • 21
    • 0029362452 scopus 로고
    • Testing heuristics: We have it all wrong
    • J.N. Hooker Testing heuristics: We have it all wrong Journal of Heuristics 1 1995 33 42
    • (1995) Journal of Heuristics , vol.1 , pp. 33-42
    • Hooker, J.N.1
  • 24
    • 79952620964 scopus 로고    scopus 로고
    • Firing sequences backward algorithm for simple assembly line balancing problem of type 1
    • O. Kilincci Firing sequences backward algorithm for simple assembly line balancing problem of type 1 Computers & Industrial Engineering 60 2011 830 839
    • (2011) Computers & Industrial Engineering , vol.60 , pp. 830-839
    • Kilincci, O.1
  • 25
    • 0000698758 scopus 로고
    • Characterization and generation of a general class of resource-constrained project scheduling problems
    • R. Kolisch, A. Sprecher, and A. Drexl Characterization and generation of a general class of resource-constrained project scheduling problems Management Science 41 1995 1693 1703
    • (1995) Management Science , vol.41 , pp. 1693-1703
    • Kolisch, R.1    Sprecher, A.2    Drexl, A.3
  • 26
    • 74549129380 scopus 로고    scopus 로고
    • Heuristic procedures for solving the general assembly line balancing problem with setups
    • L. Martino, and R. Pastor Heuristic procedures for solving the general assembly line balancing problem with setups International Journal of Production Research 48 2010 1787 1804
    • (2010) International Journal of Production Research , vol.48 , pp. 1787-1804
    • Martino, L.1    Pastor, R.2
  • 27
    • 0001636411 scopus 로고
    • An experimental investigation and comparative evaluation of production line balancing techniques
    • A.A. Mastor An experimental investigation and comparative evaluation of production line balancing techniques Management Science 16 1970 728 746
    • (1970) Management Science , vol.16 , pp. 728-746
    • Mastor, A.A.1
  • 29
    • 0002569892 scopus 로고
    • A heuristic method of assembly line balancing for assumptions of constant or variable work element times
    • C.L. Moodie, and H.H. Young A heuristic method of assembly line balancing for assumptions of constant or variable work element times Journal of Industrial Engineering 16 1965 23 29
    • (1965) Journal of Industrial Engineering , vol.16 , pp. 23-29
    • Moodie, C.L.1    Young, H.H.2
  • 33
    • 84875229599 scopus 로고    scopus 로고
    • Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing
    • A. Otto, C. Otto, and A. Scholl Systematic data generation and test design for solution algorithms on the example of SALBPGen for assembly line balancing European Journal of Operational Research 228 2013 33 45
    • (2013) European Journal of Operational Research , vol.228 , pp. 33-45
    • Otto, A.1    Otto, C.2    Scholl, A.3
  • 34
    • 68249099005 scopus 로고    scopus 로고
    • A survey of dynamic scheduling in manufacturing systems
    • D. Ouelhadj, and S. Petrovic A survey of dynamic scheduling in manufacturing systems Journal of Scheduling 12 2009 417 431
    • (2009) Journal of Scheduling , vol.12 , pp. 417-431
    • Ouelhadj, D.1    Petrovic, S.2
  • 36
    • 84892959131 scopus 로고    scopus 로고
    • An improved mathematical program to solve the simple assembly line balancing problem
    • R. Pastor, and L. Ferrer An improved mathematical program to solve the simple assembly line balancing problem International Journal of Production Research 25 2009 45 61
    • (2009) International Journal of Production Research , vol.25 , pp. 45-61
    • Pastor, R.1    Ferrer, L.2
  • 38
    • 25144482035 scopus 로고    scopus 로고
    • State-Of-The-Art exact and heuristic solution procedures for simple assembly line balancing
    • DOI 10.1016/j.ejor.2004.07.022, PII S0377221704004795, Balancing Assembly and Transfer Lines
    • A. Scholl, and C. Becker State-of-the-art exact and heuristic solution procedures for simple assembly line balancing European Journal of Operational Research 168 2006 666 693 (Pubitemid 41336586)
    • (2006) European Journal of Operational Research , vol.168 , Issue.3 , pp. 666-693
    • Scholl, A.1    Becker, C.2
  • 40
    • 0001193704 scopus 로고    scopus 로고
    • SALOME: A bidirectional branch-and-bound procedure for assembly line balancing
    • A. Scholl, and R. Klein SALOME: A bidirectional branch and bound procedure for assembly line balancing INFORMS Journal on Computing 9 1997 319 334 (Pubitemid 127697778)
    • (1997) INFORMS Journal on Computing , vol.9 , Issue.4 , pp. 319-334
    • Scholl, A.1    Klein, R.2
  • 41
    • 0033115142 scopus 로고    scopus 로고
    • Balancing assembly lines effectively - A computational comparison
    • A. Scholl, and R. Klein Balancing assembly lines effectively - A computational comparison European Journal of Operational Research 114 1999 50 58
    • (1999) European Journal of Operational Research , vol.114 , pp. 50-58
    • Scholl, A.1    Klein, R.2
  • 42
    • 0031543416 scopus 로고    scopus 로고
    • Simple assembly line balancing - Heuristic approaches
    • A. Scholl, and S. Voß Simple assembly line balancing - Heuristic approaches Journal of Heuristics 2 1996 217 244
    • (1996) Journal of Heuristics , vol.2 , pp. 217-244
    • Scholl, A.1    Voß, S.2
  • 43
    • 84867541884 scopus 로고    scopus 로고
    • A branch, bound, and remember algorithm for the simple assembly line balancing problem
    • E.C. Sewell, and S.H. Jacobson A branch, bound, and remember algorithm for the simple assembly line balancing problem INFORMS Journal on Computing 24 2012 433 442
    • (2012) INFORMS Journal on Computing , vol.24 , pp. 433-442
    • Sewell, E.C.1    Jacobson, S.H.2
  • 44
    • 0026930899 scopus 로고
    • New search spaces for sequencing problems with application to job shop scheduling
    • R.H. Storer, D.S. Wu, and R. Vaccari New search spaces for sequencing problems with application to job shop scheduling Management Science 38 1992 1495 1509 (Pubitemid 23633245)
    • (1992) Management Science , vol.38 , Issue.10 , pp. 1495-1509
    • Storer Robert, H.1    Wu S.David2    Vaccari Renzo3
  • 46
    • 38849162891 scopus 로고    scopus 로고
    • Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems
    • DOI 10.1016/j.cie.2007.08.008, PII S0360835207002008
    • J.C. Tay, and N.B. Ho Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems Computers & Industrial Engineering 54 2008 453 473 (Pubitemid 351199798)
    • (2008) Computers and Industrial Engineering , vol.54 , Issue.3 , pp. 453-473
    • Tay, J.C.1    Ho, N.B.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.