메뉴 건너뛰기




Volumn 39, Issue 3, 2012, Pages 736-745

Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage

Author keywords

Hybrid flow shop; Multiprocessor scheduling; Precedence relations; Randomized list scheduling

Indexed keywords

AVERAGE DEVIATION; HEURISTIC SOLUTIONS; HYBRID FLOW SHOP; IDLE TIME; LIST-SCHEDULING; MULTI PROCESSOR SCHEDULING; NO-WAIT; OPTIMALITY; PARALLEL MACHINE; PRECEDENCE CONSTRAINTS; PRECEDENCE RELATIONS; TWO-STAGE HYBRID FLOW SHOP;

EID: 79960171156     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.05.020     Document Type: Article
Times cited : (28)

References (20)
  • 1
    • 34548625026 scopus 로고    scopus 로고
    • Modeling realistic hybrid flexible flowshop scheduling problems
    • DOI 10.1016/j.cor.2006.07.014, PII S0305054806001560
    • R. Ruiz, F. erifolu, and T. Urlings Modeling realistic hybrid flexible flowshop scheduling problems Computers & Operations Research 35 4 2008 1151 1175 (Pubitemid 47404765)
    • (2008) Computers and Operations Research , vol.35 , Issue.4 , pp. 1151-1175
    • Ruiz, R.1    Serifoglu, F.S.2    Urlings, T.3
  • 2
    • 73449099561 scopus 로고    scopus 로고
    • Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
    • I. Ribas, R. Leisten, and J. Framinan Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective Computers & Operations Research 37 8 2010 1439 1454
    • (2010) Computers & Operations Research , vol.37 , Issue.8 , pp. 1439-1454
    • Ribas, I.1    Leisten, R.2    Framinan, J.3
  • 3
    • 0031543097 scopus 로고    scopus 로고
    • Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
    • J. Gupta, A. Hariri, and C. Potts Scheduling a two-stage hybrid flow shop with parallel machines at the first stage Annals of Operations Research 69 1997 171 191 (Pubitemid 127503103)
    • (1997) Annals of Operations Research , vol.69 , pp. 171-191
    • Gupta, J.N.D.1    Hariri, A.M.A.2    Potts, C.N.3
  • 4
  • 5
    • 0031543210 scopus 로고    scopus 로고
    • Shop scheduling problems under precedence constraints
    • V. Strusevich Shop scheduling problems under precedence constraints Annals of Operations Research 69 1997 351 377 (Pubitemid 127503112)
    • (1997) Annals of Operations Research , vol.69 , pp. 351-377
    • Strusevich, V.A.1
  • 6
    • 0009412895 scopus 로고    scopus 로고
    • Reduction of job-shop problems to flow-shop problems with precedence constraints
    • PII S037722179700129X
    • A. Guinet, and M. Legrand Reduction of job-shop problems to flow-shop problems with precedence constraints European Journal of Operational Research 109 1 1998 96 110 (Pubitemid 128393231)
    • (1998) European Journal of Operational Research , vol.109 , Issue.1 , pp. 96-110
    • Guinet, A.1    Legrand, M.2
  • 7
    • 26444535340 scopus 로고    scopus 로고
    • Three stage generalized flowshop: Scheduling civil engineering projects
    • M. Dror, and P. Mullaseril Three stage generalized flowshop: scheduling civil engineering projects Journal of Global Optimization 9 1996 321 344 (24) (Pubitemid 126714013)
    • (1996) Journal of Global Optimization , vol.9 , Issue.3-4 , pp. 321-344
    • Dror, M.1    Mullaseril, P.A.2
  • 9
    • 0033906893 scopus 로고    scopus 로고
    • Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness
    • DOI 10.1016/S0925-5273(99)00048-1
    • V. Botta-Genoulaz Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness International Journal of Production Economics 64 13 2000 101 111 (Pubitemid 30557647)
    • (2000) International Journal of Production Economics , vol.64 , Issue.1 , pp. 101-111
    • Botta-Genoulaz, V.1
  • 13
  • 14
    • 0033479482 scopus 로고    scopus 로고
    • Satisfiability tests and time-bound adjustments for cumulative scheduling problems
    • P. Baptiste, C. Le Pape, and W. Nuijten Satisfiability tests and time-bound adjustments for cumulative scheduling problems Annals of Operations Research 92 1999 305 333
    • (1999) Annals of Operations Research , vol.92 , pp. 305-333
    • Baptiste, P.1    Le Pape, C.2    Nuijten, W.3
  • 16
    • 0017488606 scopus 로고
    • Improving the computation of lower bounds for optimal schedules
    • T. Lang, and E. Fernandez Improving the computation of lower bounds for optimal schedules IBM Journal of Research and Development 21 3 1977 273 280 (Pubitemid 8568490)
    • (1977) IBM Journal of Research and Development , vol.21 , Issue.3 , pp. 273-280
    • Lang, T.1    Fernandez, E.B.2
  • 17
    • 0021529549 scopus 로고
    • Practical multiprocessor scheduling algorithms for efficient parallel processing
    • H. Kasahara, and S. Narita Practical multiprocessor scheduling algorithms for efficient parallel processing IEEE Transactions on Computers 33 11 1984 1023 1029 (Pubitemid 14663498)
    • (1984) IEEE Transactions on Computers , vol.C-33 , Issue.11 , pp. 1023-1029
    • Kasahara, H.1    Narita, S.2
  • 18
    • 0024647955 scopus 로고
    • Scheduling precedence graphs in systems with interprocessor communication times
    • J.-J. Hwang, Y.-C. Chow, F. Anger, and C.-Y. Lee Scheduling precedence graphs in systems with interprocessor communication times SIAM Journal on Computing 18 2 1989 244 257
    • (1989) SIAM Journal on Computing , vol.18 , Issue.2 , pp. 244-257
    • Hwang, J.-J.1    Chow, Y.-C.2    Anger, F.3    Lee, C.-Y.4
  • 19
    • 0023385165 scopus 로고
    • Semi-greedy heuristics: An empirical study
    • J.P. Hart, and A.W. Shogan Semi-greedy heuristics: an empirical study Operations Research Letters 6 3 1987 107 114
    • (1987) Operations Research Letters , vol.6 , Issue.3 , pp. 107-114
    • Hart, J.P.1    Shogan, A.W.2
  • 20
    • 79960152860 scopus 로고    scopus 로고
    • last access January 8
    • Standard task graph set, 〈 http://www.kasahara.elec.waseda.ac.jp/ schedule/index.html 〉, last access January 8, 2011.
    • (2011) Standard Task Graph Set


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