SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 25, Issue 4, 2003, Pages 549-574

Flow-shop problems with intermediate buffers

(3) Brucker, Peter a Heitmann, Silvia a Hurink, Johann b

a UNIVERSITY OF OSNABRÜCK (Germany)

b UNIVERSITY OF TWENTE (Netherlands)

Author keywords

Buffer; Flow shop problem; Tabu search

Indexed keywords

EID: 1442305305 PISSN: 01716468 EISSN: 14366304 Source Type: Journal
DOI: 10.1007/s00291-003-0133-7 Document Type: Article

Times cited : (64)

References (17)

1
- 0001255490
- A computational study of local search algorithms for job shop scheduling
- Aarts EHL, van Laarhoven PJM, Lenstra JK, Ulder NLJ (1994) A computational study of local search algorithms for job shop scheduling. ORSA Journal on Computing 6: 118-125
- (1994) ORSA Journal on Computing , vol.6 , pp. 118-125
- Aarts, E.H.L.¹ Van Laarhoven, P.J.M.² Lenstra, J.K.³ Ulder, N.L.J.⁴

2
- 43949161199
- A fast branch & bound algorithm for the job-shop scheduling problem
- Brucker P, Jurisch B, Sievers B (1994) A fast branch & bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics 49: 107-127
- (1994) Discrete Applied Mathematics , vol.49 , pp. 107-127
- Brucker, P.¹ Jurisch, B.² Sievers, B.³

3
- 0000411214
- Tabu Search, Part I and II
- Glover F (1989, 1990) Tabu Search, Part I and II. ORSA Journal Computing 1: 190-206, ORSA Journal Computing 2: 4-32
- (1989) ORSA Journal Computing , vol.1 , pp. 190-206
- Glover, F.¹

4
- 85039570996
- Glover F (1989, 1990) Tabu Search, Part I and II. ORSA Journal Computing 1: 190-206, ORSA Journal Computing 2: 4-32
- ORSA Journal Computing , vol.2 , pp. 4-32

5
- 0040362383
- Block algorithm for scheduling of operations in job shop systems (Polish)
- Grabowski J, Nowicki E, Smutnicki C (1988) Block algorithm for scheduling of operations in job shop systems (Polish). Przeglad Statystyczny 35: 67-80
- (1988) Przeglad Statystyczny , vol.35 , pp. 67-80
- Grabowski, J.¹ Nowicki, E.² Smutnicki, C.³

6
- 0022769848
- A block approach for single machine scheduling with release dates and due dates
- Grabowski J, Nowicki E, Zdrzalka S (1986) A block approach for single machine scheduling with release dates and due dates. European Journal of Operational Research 26: 278-285
- (1986) European Journal of Operational Research , vol.26 , pp. 278-285
- Grabowski, J.¹ Nowicki, E.² Zdrzalka, S.³

7
- 0030134958
- A survey of machine scheduling problems with blocking and no-wait in process
- Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44: 510-525
- (1996) Operations Research , vol.44 , pp. 510-525
- Hall, N.G.¹ Sriskandarajah, C.²

8
- 1442327091
- VDI-Verlag, Düsseldorf 1985
- Leisten R (1985) Die Einbeziehung beschränkter Zwischenlager in die Auftragsreihenfolgeplanung bei Reihenfertigung. VDI-Verlag, Düsseldorf 1985
- (1985) Die Einbeziehung Beschränkter Zwischenlager in die Auftragsreihenfolgeplanung bei Reihenfertigung
- Leisten, R.¹

9
- 0001057408
- Flowshop sequencing problems with limited buffer storage
- Leisten R (1990) Flowshop sequencing problems with limited buffer storage. International Journal of Production Research 28: 2085-2100
- (1990) International Journal of Production Research , vol.28 , pp. 2085-2100
- Leisten, R.¹

10
- 0020699921
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
- Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11: 91-95
- (1983) Omega , vol.11 , pp. 91-95
- Nawaz, M.¹ Enscore, E.E.² Ham, I.³

11
- 0032649738
- The permutation flow shop with buffers: A tabu search approach
- Nowicki E (1999) The permutation flow shop with buffers: A tabu search approach. European Journal of Operational Research 116: 205-219
- (1999) European Journal of Operational Research , vol.116 , pp. 205-219
- Nowicki, E.¹

12
- 5244278595
- A fast taboo search algorithm for the job shop problem
- Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Management Sciences 42: 797-813
- (1996) Management Sciences , vol.42 , pp. 797-813
- Nowicki, E.¹ Smutnicki, C.²

13
- 0001204823
- A fast taboo search algorithm for the permutation flow shop problem
- Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the permutation flow shop problem. European Journal of Operational Research 91: 160-175
- (1996) European Journal of Operational Research , vol.91 , pp. 160-175
- Nowicki, E.¹ Smutnicki, C.²

14
- 84976662527
- Flow shop scheduling with limited temporary storage
- Papadimitriou CH, Kanellakis PC (1980) Flow shop scheduling with limited temporary storage. Journal of Association Computing Machine 27: 533-549
- (1980) Journal of Association Computing Machine , vol.27 , pp. 533-549
- Papadimitriou, C.H.¹ Kanellakis, P.C.²

15
- 54549127964
- A two-machine permutation flow shop scheduling problem with buffers
- Smutnicki C (1998) A two-machine permutation flow shop scheduling problem with buffers. OR Spektrum 20: 229-235
- (1998) OR Spektrum , vol.20 , pp. 229-235
- Smutnicki, C.¹

16
- 0027201278
- Benchmarks for basic scheduling problems
- Taillard E (1993) Benchmarks for basic scheduling problems. European Journal of Operational Research 64: 278-285. Web Page http://www.eivd.ch/ina/collaborateurs/etd/problemes.dir/problemes.html
- (1993) European Journal of Operational Research , vol.64 , pp. 278-285
- Taillard, E.¹

17
- 85039569423
- Operations Research Library of Problems. Management School, Imperial College London, File flowshop2.txt
- Vaessens RJM (1996) Operations Research Library of Problems. Management School, Imperial College London. Web Page http://mscmga.ms.ic.ac.uk/info.html, File flowshop2.txt
- (1996)
- Vaessens, R.J.M.¹

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