메뉴 건너뛰기




Volumn 160, Issue 13-14, 2012, Pages 1955-1963

Scenario based robust line balancing: Computational complexity

Author keywords

Computational complexity; Line balancing; Min max approach; Scenario; Uncertainty

Indexed keywords

DYNAMIC PROGRAMMING ALGORITHM; EXECUTION TIME; LINE BALANCING; LINE BALANCING PROBLEM; LINE CYCLES; MIN-MAX; NP-HARD; POLYNOMIAL-TIME ALGORITHMS; PRECEDENCE RELATIONS; SCENARIO; STRONGLY NP-HARD; TRANSFER LINES; UNCERTAINTY;

EID: 84862191908     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2012.04.011     Document Type: Article
Times cited : (47)

References (26)
  • 1
    • 80054935233 scopus 로고    scopus 로고
    • Minimizing the number of late jobs on a single machine under due date uncertainty
    • H. Aissi, M.A. Aloulou, and M. Kovalyov Minimizing the number of late jobs on a single machine under due date uncertainty Journal of Scheduling 14 2010 351 361
    • (2010) Journal of Scheduling , vol.14 , pp. 351-361
    • Aissi, H.1    Aloulou, M.A.2    Kovalyov, M.3
  • 2
    • 60749104714 scopus 로고    scopus 로고
    • Minmax and minmax regret versions of combinatorial optimization problems: A survey
    • H. Aissi, C. Bazgan, and D. Vanderpooten Minmax and minmax regret versions of combinatorial optimization problems: A survey European Journal of Operational Research 197 2009 427 438
    • (2009) European Journal of Operational Research , vol.197 , pp. 427-438
    • Aissi, H.1    Bazgan, C.2    Vanderpooten, D.3
  • 3
    • 78751585229 scopus 로고    scopus 로고
    • Minmax regret bottleneck problems with solution-induced interval uncertainty structure
    • I. Averbakh Minmax regret bottleneck problems with solution-induced interval uncertainty structure Discrete Optimization 7 2010 181 190
    • (2010) Discrete Optimization , vol.7 , pp. 181-190
    • Averbakh, I.1
  • 5
    • 0022768294 scopus 로고
    • Survey of exact algorithms for the simple assembly line balancing problem
    • I. Baybars A survey of exact algorithms for the simple assembly line balancing Management Science 32 1986 909 932 (Pubitemid 16612186)
    • (1986) Management Science , vol.32 , Issue.8 , pp. 909-932
    • Baybars Ilker1
  • 6
    • 78549246150 scopus 로고    scopus 로고
    • The minmax regret gradual covering location problem on a network with incomplete information of demand weights
    • O. Berman, and J. Wang The minmax regret gradual covering location problem on a network with incomplete information of demand weights European Journal of Operational Research 208 2011 233 238
    • (2011) European Journal of Operational Research , vol.208 , pp. 233-238
    • Berman, O.1    Wang, J.2
  • 7
    • 34249995941 scopus 로고    scopus 로고
    • A classification of assembly line balancing problems
    • DOI 10.1016/j.ejor.2006.10.010, PII S0377221706010435
    • N. Boysen, M. Fliedner, and A. Scholl A classification of assembly line balancing problems European Journal of Operational Research 183 2007 674 693 (Pubitemid 46891133)
    • (2007) European Journal of Operational Research , vol.183 , Issue.2 , pp. 674-693
    • Boysen, N.1    Fliedner, M.2    Scholl, A.3
  • 10
    • 56349124174 scopus 로고    scopus 로고
    • Balancing modular transfer lines with serial-parallel activation of spindle heads at stations
    • A. Dolgui, and I. Ihnatsenka Balancing modular transfer lines with serial-parallel activation of spindle heads at stations Discrete Applied Mathematics 157 2009 68 89
    • (2009) Discrete Applied Mathematics , vol.157 , pp. 68-89
    • Dolgui, A.1    Ihnatsenka, I.2
  • 12
    • 1242309349 scopus 로고    scopus 로고
    • Benefits of skill chaining in serial production lines with cross-trained workers
    • W. Hopp, E. Tekin, and M.P.V. Oyen Benefits of skill chaining in serial production lines with cross-trained workers Management Science 50 2004 83 98
    • (2004) Management Science , vol.50 , pp. 83-98
    • Hopp, W.1    Tekin, E.2    Oyen, M.P.V.3
  • 13
    • 2342477487 scopus 로고
    • Topological sorting of large networks
    • A.B. Kahn Topological sorting of large networks Communications of the ACM 5 1962 558 562
    • (1962) Communications of the ACM , vol.5 , pp. 558-562
    • Kahn, A.B.1
  • 15
    • 0037851101 scopus 로고    scopus 로고
    • Exact and approximate algorithms for scheduling unit time tasks with tree-like precedence constraints
    • Paris
    • W. Kubiak, Exact and approximate algorithms for scheduling unit time tasks with tree-like precedence constraints, in: Abstracts EURO IX - TIMS XXVIII, Paris, p.195.
    • Abstracts EURO IX - TIMS XXVIII , pp. 195
    • Kubiak, W.1
  • 17
    • 75449106353 scopus 로고    scopus 로고
    • Robust network optimization under polyhedral demand uncertainty is NP-hard
    • M. Minoux Robust network optimization under polyhedral demand uncertainty is NP-hard Discrete Applied Mathematics 158 2010 597 603
    • (2010) Discrete Applied Mathematics , vol.158 , pp. 597-603
    • Minoux, M.1
  • 18
    • 38049000847 scopus 로고    scopus 로고
    • Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled
    • C. Miralles, J.P. García-Sabater, C. Andrés, and M. Cardós Branch and bound procedures for solving the assembly line worker assignment and balancing problem: application to sheltered work centres for disabled Discrete Applied Mathematics 156 2008 357 367
    • (2008) Discrete Applied Mathematics , vol.156 , pp. 357-367
    • Miralles, C.1    García-Sabater, J.P.2    Andrés, C.3    Cardós, M.4
  • 21
    • 69749108455 scopus 로고    scopus 로고
    • Robustness in operational research and decision aiding: A multi-faceted issue
    • B. Roy Robustness in operational research and decision aiding: a multi-faceted issue European Journal of Operations Research 200 2010 629 638
    • (2010) European Journal of Operations Research , vol.200 , pp. 629-638
    • Roy, B.1
  • 23
    • 25144442374 scopus 로고    scopus 로고
    • Stability analysis of an optimal balance for an assembly line with fixed cycle time
    • DOI 10.1016/j.ejor.2004.07.028, PII S0377221704004850, Balancing Assembly and Transfer Lines
    • Y.N. Sotskov, A. Dolgui, and M.C. Portmann Stability analysis of an optimal balance for an assembly line with fixed cycle time European Journal of Operations Research 168 2006 783 797 (Pubitemid 41336592)
    • (2006) European Journal of Operational Research , vol.168 , Issue.3 , pp. 783-797
    • Sotskov, Y.N.1    Dolgui, A.2    Portmann, M.-C.3
  • 24
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • R. Tarjan Depth-first search and linear graph algorithms SIAM Journal on Computing 1 1972 146 160
    • (1972) SIAM Journal on Computing , vol.1 , pp. 146-160
    • Tarjan, R.1
  • 26
    • 77954871314 scopus 로고    scopus 로고
    • Robust assembly line balancing with interval uncertain task times
    • W. Xu, and T. Xiao Robust assembly line balancing with interval uncertain task times Computer-Integrated Manufacturing Systems 16 2010 1202 1207
    • (2010) Computer-Integrated Manufacturing Systems , vol.16 , pp. 1202-1207
    • Xu, W.1    Xiao, T.2


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