메뉴 건너뛰기




Volumn 111, Issue 2, 2010, Pages 77-81

A note on makespan minimization in proportionate flow shops

Author keywords

Combinatorial problems

Indexed keywords

CHARACTERISTIC VALUE; COMBINATORIAL PROBLEM; MAKESPAN; MAKESPAN MINIMIZATION; ON-MACHINES; PROCESSING TIME; PROPORTIONATE FLOW SHOP;

EID: 78149351078     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.10.016     Document Type: Article
Times cited : (6)

References (19)
  • 1
    • 0030270129 scopus 로고    scopus 로고
    • Two-machine proportionate flowshop scheduling with breakdown to minimize maximum lateness
    • A. Allahverdi Two-machine proportionate flowshop scheduling with breakdown to minimize maximum lateness Computers and Operations Research 23 1996 909 916
    • (1996) Computers and Operations Research , vol.23 , pp. 909-916
    • Allahverdi, A.1
  • 2
    • 38149027740 scopus 로고    scopus 로고
    • A state-of-the-art review on scheduling with learning effects
    • D. Biskup A state-of-the-art review on scheduling with learning effects European Journal of Operational Research 188 2008 315 329
    • (2008) European Journal of Operational Research , vol.188 , pp. 315-329
    • Biskup, D.1
  • 4
    • 33749558671 scopus 로고    scopus 로고
    • Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
    • B.C. Choi, S.H. Yoon, and S.J. Chung Minimizing maximum completion time in a proportionate flow shop with one machine of different speed European Journal of Operational Research 176 2007 964 974
    • (2007) European Journal of Operational Research , vol.176 , pp. 964-974
    • Choi, B.C.1    Yoon, S.H.2    Chung, S.J.3
  • 8
    • 0033311145 scopus 로고    scopus 로고
    • Minimizing total completion time in a two-machine flowshop: Analysis of special cases
    • J.A. Hoogeveen, and T. Kawaguchi Minimizing total completion time in a two-machine flowshop: analysis of special cases Mathematics of Operations Research 24 1999 887 910
    • (1999) Mathematics of Operations Research , vol.24 , pp. 887-910
    • Hoogeveen, J.A.1    Kawaguchi, T.2
  • 9
    • 0037402799 scopus 로고    scopus 로고
    • The three-machine proportionate flow shop with unequal machine speeds
    • S. Hou, and H. Hoogeveen The three-machine proportionate flow shop with unequal machine speeds Operations Research Letters 31 2003 225 231
    • (2003) Operations Research Letters , vol.31 , pp. 225-231
    • Hou, S.1    Hoogeveen, H.2
  • 10
    • 0003075019 scopus 로고
    • Optimal two- and three-stage production schedules with setup times included
    • S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1954 62 67
    • (1954) Naval Research Logistics Quarterly , vol.1 , pp. 62-67
    • Johnson, S.M.1
  • 12
    • 0022093883 scopus 로고
    • Focused scheduling in proportionate flow shops
    • P.S. Ow Focused scheduling in proportionate flow shops Management Science 31 1985 851 869
    • (1985) Management Science , vol.31 , pp. 851-869
    • Ow, P.S.1
  • 13
    • 0016993158 scopus 로고
    • An ordered flow shop sequencing problem with mean completion time criterion
    • S.S. Panwalkar, and A.W. Khan An ordered flow shop sequencing problem with mean completion time criterion International Journal of Production Research 14 1976 631 635
    • (1976) International Journal of Production Research , vol.14 , pp. 631-635
    • Panwalkar, S.S.1    Khan, A.W.2
  • 16
    • 34547404222 scopus 로고    scopus 로고
    • A survey of scheduling with controllable processing times
    • D. Shabtay, and G. Steiner A survey of scheduling with controllable processing times Discrete Applied Mathematics 155 2007 1643 1666
    • (2007) Discrete Applied Mathematics , vol.155 , pp. 1643-1666
    • Shabtay, D.1    Steiner, G.2
  • 17
    • 0012775455 scopus 로고    scopus 로고
    • Minimizing total weighted completion time in a proportionate flow shop
    • N. Shakhlevich, H. Hoogeveen, and M. Pinedo Minimizing total weighted completion time in a proportionate flow shop Journal of Scheduling 1 1998 157 168
    • (1998) Journal of Scheduling , vol.1 , pp. 157-168
    • Shakhlevich, N.1    Hoogeveen, H.2    Pinedo, M.3
  • 18
    • 0000660478 scopus 로고
    • Flow shop sequencing problem with ordered processing time matrices
    • M.L. Smith, S.S. Panwalkar, and R.A. Dudek Flow shop sequencing problem with ordered processing time matrices Management Science 21 1975 544 549
    • (1975) Management Science , vol.21 , pp. 544-549
    • Smith, M.L.1    Panwalkar, S.S.2    Dudek, R.A.3
  • 19
    • 0017001721 scopus 로고
    • Flow shop sequencing problem with ordered processing time matrices: A general case
    • M.L. Smith, S.S. Panwalkar, and R.A. Dudek Flow shop sequencing problem with ordered processing time matrices: a general case Naval Research Logistics Quarterly 23 1976 481 486
    • (1976) Naval Research Logistics Quarterly , vol.23 , pp. 481-486
    • Smith, M.L.1    Panwalkar, S.S.2    Dudek, R.A.3


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