SCOPUS 정보 검색 플랫폼

Journal of Combinatorial Optimization

Volumn 22, Issue 4, 2011, Pages 797-818

Minimizing makespan in an ordered flow shop with machine-dependent processing times

(3) Choi, Byung Cheon a Leung, Joseph Y T b Pinedo, Michael L c

a Chungnam National University (South Korea)

b University Heights (United States)

c NEW YORK UNIVERSITY (United States)

Author keywords

Computational complexity; Machine dependent processing times; Makespan; Proportionate flow shop

Indexed keywords

CHARACTERISTIC VALUE; FLOW-SHOPS; MAKESPAN; MAKESPAN OBJECTIVE; MINIMIZING MAKESPAN; PERMUTATION SCHEDULES; POLYNOMIAL-TIME; PROCESSING TIME; PROPORTIONATE FLOW SHOP; SET-UP TIME;

COMPUTATIONAL COMPLEXITY; MACHINE SHOP PRACTICE; POLYNOMIAL APPROXIMATION;

SCHEDULING ALGORITHMS;

EID: 83555172646 PISSN: 13826905 EISSN: 15732886 Source Type: Journal
DOI: 10.1007/s10878-010-9330-x Document Type: Article

Times cited : (10)

References (21)

1
- 0025417561
- Faster algorithms for the shortest path problem
- 1072256
- RK Ahuja K Mehlhorn JB Orlin RE Tarjan 1996 Faster algorithms for the shortest path problem J Assoc Comput Mach 37 213 223 1072256
- (1996) J Assoc Comput Mach , vol.37 , pp. 213-223
- Ahuja, R.K.¹ Mehlhorn, K.² Orlin, J.B.³ Tarjan, R.E.⁴

2
- 0030270129
- Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness
- DOI 10.1016/0305-0548(96)00012-3
- A Allahverdi 1996 Two-machine proportionate flowshop scheduling with breakdown to minimize maximum lateness Comput Oper Res 23 909 916 0863.90080 10.1016/0305-0548(96)00012-3 (Pubitemid 126374443)
- (1996) Computers and Operations Research , vol.23 , Issue.10 , pp. 909-916
- Allahverdi, A.¹

3
- 38149027740
- A state-of-the-art review on scheduling with learning effects
- 2384086 1129.90022 10.1016/j.ejor.2007.05.040
- D Biskup 2008 A state-of-the-art review on scheduling with learning effects Eur J Oper Res 188 315 329 2384086 1129.90022 10.1016/j.ejor.2007.05.040
- (2008) Eur J Oper Res , vol.188 , pp. 315-329
- Biskup, D.¹

4
- 0000647451
- A review of flowshop-scheduling research with set-up times
- 10.1111/j.1937-5956.2000.tb00137.x
- TCE Cheng JND Gupta G Wang 2000 A review of flowshop-scheduling research with set-up times Prod Oper Manag 9 262 282 10.1111/j.1937-5956.2000.tb00137.x
- (2000) Prod Oper Manag , vol.9 , pp. 262-282
- Cheng, T.C.E.¹ Gupta, J.N.D.² Wang, G.³

5
- 33749558671
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- DOI 10.1016/j.ejor.2005.09.030, PII S0377221705008325
- BC Choi SH Yoon SJ Chung 2007 Minimizing maximum completion time in a proportionate flow shop with one machine of different speed Eur J Oper Res 176 964 974 2308703 1110.90036 10.1016/j.ejor.2005.09.030 (Pubitemid 44537634)
- (2007) European Journal of Operational Research , vol.176 , Issue.2 , pp. 964-974
- Choi, B.-C.¹ Yoon, S.-H.² Chung, S.-J.³

6
- 0016952078
- The complexity of flowshop and jobshop scheduling
- 418895 0396.90041 10.1287/moor.1.2.117
- MR Garey DS Johnson R Sethi 1976 The complexity of flowshop and jobshop scheduling Math Oper Res 1 117 129 418895 0396.90041 10.1287/moor.1.2.117
- (1976) Math Oper Res , vol.1 , pp. 117-129
- Garey, M.R.¹ Johnson, D.S.² Sethi, R.³

7
- 69249218790
- Springer Berlin 1155.90004
- Gawiejnowicz S (2008) Time-dependent scheduling. Springer, Berlin
- (2008) Time-dependent Scheduling
- Gawiejnowicz, S.¹

8
- 49649136358
- An efficient algorithm for determining the convex hull of a finite planar set
- 0236.68013 10.1016/0020-0190(72)90045-2
- RL Graham 1972 An efficient algorithm for determining the convex hull of a finite planar set Inf Process Lett 1 132 133 0236.68013 10.1016/0020-0190(72) 90045-2
- (1972) Inf Process Lett , vol.1 , pp. 132-133
- Graham, R.L.¹

9
- 27844512878
- Flowshop-scheduling problems with makespan criterion: A review
- DOI 10.1080/0020754050056417
- SR Hejazi S Saghafian 2005 Flowshop-scheduling problems with makespan criterion: a review Int J Prod Res 43 2895 2929 1068.90059 10.1080/ 0020754050056417 (Pubitemid 41657440)
- (2005) International Journal of Production Research , vol.43 , Issue.14 , pp. 2895-2929
- Reza Hejazi, S.¹ Saghafian, S.²

10
- 0033311145
- Minimizing total completion time in a two-machine flowshop: Analysis of special cases
- JA Hoogeveen T Kawaguchi 1999 Minimizing total completion time in a two-machine flowshop: analysis of special cases Math Oper Res 24 887 910 1854358 0977.90015 10.1287/moor.24.4.887 (Pubitemid 30565507)
- (1999) Mathematics of Operations Research , vol.24 , Issue.4 , pp. 887-910
- Hoogeveen, J.A.¹ Kawaguchi, T.²

11
- 0037402799
- The three-machine proportionate flow shop with unequal machine speeds
- 1967294 1013.90068 10.1016/S0167-6377(02)00232-8
- S Hou H Hoogeveen 2003 The three-machine proportionate flow shop with unequal machine speeds Oper Res Lett 31 225 231 1967294 1013.90068 10.1016/S0167-6377(02)00232-8
- (2003) Oper Res Lett , vol.31 , pp. 225-231
- Hou, S.¹ Hoogeveen, H.²

12
- 0003075019
- Optimal two- and three-stage production schedules with setup times included
- 10.1002/nav.3800010110
- SM Johnson 1954 Optimal two- and three-stage production schedules with setup times included Nav Res Logist Q 1 62 67 10.1002/nav.3800010110
- (1954) Nav Res Logist Q , vol.1 , pp. 62-67
- Johnson, S.M.¹

13
- 53049104711
- A note on the proportional flow shop with a bottleneck machine
- 2463289 1176.90225 10.1016/j.ejor.2008.01.031
- C Koulamas GJ Kyparisis 2009 A note on the proportional flow shop with a bottleneck machine Eur J Oper Res 193 644 645 2463289 1176.90225 10.1016/j.ejor.2008.01.031
- (2009) Eur J Oper Res , vol.193 , pp. 644-645
- Koulamas, C.¹ Kyparisis, G.J.²

14
- 0022093883
- Focused scheduling in proportionate flow shops
- 10.1287/mnsc.31.7.852
- PS Ow 1985 Focused scheduling in proportionate flow shops Manag Sci 31 851 869 10.1287/mnsc.31.7.852
- (1985) Manag Sci , vol.31 , pp. 851-869
- Ow, P.S.¹

15
- 0016993158
- An ordered flow shop sequencing problem with mean completion time criterion
- 10.1080/00207547608956381
- SS Panwalkar AW Khan 1976 An ordered flow shop sequencing problem with mean completion time criterion Int J Prod Res 14 631 635 10.1080/ 00207547608956381
- (1976) Int J Prod Res , vol.14 , pp. 631-635
- Panwalkar, S.S.¹ Khan, A.W.²

16
- 0019079201
- Ordered flow shop problems with no in-process waiting: Further results
- SS Panwalkar CR Woollam 1980 Ordered flow shop problems with no in-process waiting: future results J Oper Res Soc 31 1039 1043 592136 0441.90041 (Pubitemid 11456555)
- (1980) Journal of the Operational Research Society , vol.31 , Issue.11 , pp. 1039-1043
- Panwalkar, S.S.¹ Woollam, C.R.²

17
- 0003438602
- 2 Prentice-Hall New York 1145.90394
- Pinedo M (2002) Scheduling: theory, algorithms and systems, 2nd edn. Prentice-Hall, New York
- (2002) Scheduling: Theory, Algorithms and Systems
- Pinedo, M.¹

18
- 34547404222
- A survey of scheduling with controllable processing times
- DOI 10.1016/j.dam.2007.02.003, PII S0166218X0700025X
- D Shabtay G Steiner 2007 A survey of scheduling with controllable processing times Discrete Appl Math 155 1643 1666 2348350 1119.90022 10.1016/j.dam.2007.02.003 (Pubitemid 47176128)
- (2007) Discrete Applied Mathematics , vol.155 , Issue.13 , pp. 1643-1666
- Shabtay, D.¹ Steiner, G.²

19
- 0012775455
- Minimizing total weighted completion time in a proportionate flow shop
- N Shakhlevich H Hoogeveen M Pinedo 1998 Minimizing total weighted completion time in a proportionate flow shop J Sched 1 157 168 1991276 0909.90181 10.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y (Pubitemid 128544885)
- (1998) Journal of Scheduling , vol.1 , Issue.3 , pp. 157-168
- Shakhlevich, N.¹ Hoogeveen, H.² Pinedo, M.³

20
- 0000660478
- Flow shop sequencing problem with ordered processing time matrices
- 406474 0302.90025 10.1287/mnsc.21.5.544
- ML Smith SS Panwalkar RA Dudek 1975 Flow shop sequencing problem with ordered processing time matrices Manag Sci 21 544 549 406474 0302.90025 10.1287/mnsc.21.5.544
- (1975) Manag Sci , vol.21 , pp. 544-549
- Smith, M.L.¹ Panwalkar, S.S.² Dudek, R.A.³

21
- 0017001721
- Flow shop sequencing problem with ordered processing time matrices: A general case
- 446477 0336.90026 10.1002/nav.3800230310
- ML Smith SS Panwalkar RA Dudek 1976 Flow shop sequencing problem with ordered processing time matrices: a general case Nav Res Logist Q 23 481 486 446477 0336.90026 10.1002/nav.3800230310
- (1976) Nav Res Logist Q , vol.23 , pp. 481-486
- Smith, M.L.¹ Panwalkar, S.S.² Dudek, R.A.³

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