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

메뉴 건너뛰기

Journal of Combinatorial Optimization

Volumn 22, Issue 2, 2011, Pages 121-144

The flexible blocking job shop with transfer and set-up times

(3) Gröflin, Heinz a Pham, Dinh Nguyen b Bürgy, Reinhard a

a UNIVERSITY OF FRIBOURG (Switzerland)

b FortisBC Inc (Canada)

Author keywords

Blocking; Disjunctive graph; Flexible machines; Job shop scheduling; Setup; Tabu search

Indexed keywords

BLOCKING; DISJUNCTIVE GRAPH; FLEXIBLE MACHINES; JOB-SHOP SCHEDULING; SETUP;

SCHEDULING; SCHEDULING ALGORITHMS;

TABU SEARCH;

EID: 80051694264 PISSN: 13826905 EISSN: 15732886 Source Type: Journal
DOI: 10.1007/s10878-009-9278-x Document Type: Article

Times cited : (29)

References (14)

1
- 0035721450
- No-wait and blocking job-shops: Challenging problems for GA's
- Brizuela C, Zhao Y, Sannomiya N (2001) No-wait and blocking job-shops: challenging problems for ga's. In: IEEE international conference on systems, man, and cybernetics, vol 4, pp 2349-2354 (Pubitemid 34199540)
- (2001) Proceedings of the IEEE International Conference on Systems, Man and Cybernetics , vol.4 , pp. 2349-2354
- Brizuela, C.A.¹ Zhao, Y.² Sannomiya, N.³

2
- 38749095474
- Cyclic job shop scheduling problems with blocking
- 1151.90397 10.1007/s10479-007-0276-z
- P Brucker T Kampmeyer 2008 Cyclic job shop scheduling problems with blocking Ann Oper Res 159 1 161 181 1151.90397 10.1007/s10479-007-0276-z
- (2008) Ann Oper Res , vol.159 , Issue.1 , pp. 161-181
- Brucker, P.¹ Kampmeyer, T.²

3
- 32944480177
- Job-shop scheduling with limited capacity buffers
- DOI 10.1007/s00291-005-0008-1
- P Brucker S Heitmann J Hurink T Nieberg 2006 Job-shop scheduling with limited capacity buffers OR Spectrum 28 151 176 1101.90029 10.1007/s00291-005- 0008-1 (Pubitemid 43261024)
- (2006) OR Spectrum , vol.28 , Issue.2 , pp. 151-176
- Brucker, P.¹ Heitmann, S.² Hurink, J.³ Nieberg, T.⁴

4
- 0004215426
- Kluwer Boston 0930.90083 10.1007/978-1-4615-6089-0
- Glover F, Laguna M (1997) Tabu search. Kluwer, Boston
- (1997) Tabu Search
- Glover, F.¹ Laguna, M.²

5
- 33750453739
- Feasible insertions in job shop scheduling, short cycles and stable sets
- 1102.90021 10.1016/j.ejor.2005.12.025
- H Gröflin A Klinkert 2007 Feasible insertions in job shop scheduling, short cycles and stable sets Eur J Oper Res 177 763 785 1102.90021 10.1016/j.ejor.2005.12.025
- (2007) Eur J Oper Res , vol.177 , pp. 763-785
- Gröflin, H.¹ Klinkert, A.²

6
- 70350069044
- A new neighborhood and tabu search for the blocking job shop
- 1185.90076 10.1016/j.dam.2009.02.020
- H Gröflin A Klinkert 2009 A new neighborhood and tabu search for the blocking job shop Discrete Appl Math 157 17 3643 3655 1185.90076 10.1016/j.dam.2009.02.020
- (2009) Discrete Appl Math , vol.157 , Issue.17 , pp. 3643-3655
- Gröflin, H.¹ Klinkert, A.²

7
- 70350085533
- PhD thesis, University Osnabrück, Germany
- Heitmann S (2007) Job-shop scheduling with limited buffer capacities. PhD thesis, University Osnabrück, Germany
- (2007) Job-shop Scheduling with Limited Buffer Capacities
- Heitmann, S.¹

8
- 70350083090
- PhD thesis, University of Fribourg, Switzerland
- Klinkert A (2001) Optimization in design and control of automated high-density warehouses. PhD thesis, University of Fribourg, Switzerland
- (2001) Optimization in Design and Control of Automated High-density Warehouses
- Klinkert, A.¹

9
- 0003531165
- Internal Report RT-DIA-46-2000, Università degli Studi Roma Tre, Dipartimento di Informatica e Automazione, Italy
- Mascis A, Pacciarelli D (2000) Machine scheduling via alternative graphs. Internal Report RT-DIA-46-2000, Università degli Studi Roma Tre, Dipartimento di Informatica e Automazione, Italy
- (2000) Machine Scheduling Via Alternative Graphs
- Mascis, A.¹ Pacciarelli, D.²

10
- 0037121475
- Job-shop scheduling with blocking and no-wait constraints
- 1082.90528 10.1016/S0377-2217(01)00338-1
- A Mascis D Pacciarelli 2002 Job-shop scheduling with blocking and no-wait constraints Eur J Oper Res 143 498 517 1082.90528 10.1016/S0377-2217(01)00338-1
- (2002) Eur J Oper Res , vol.143 , pp. 498-517
- Mascis, A.¹ Pacciarelli, D.²

11
- 4444334393
- A rollout metaheuristic for job shop scheduling problems
- DOI 10.1023/B:ANOR.0000039520.24932.4b, Meta-Heuristics - Theory, Applications and Software
- C Meloni D Pacciarelli M Pranzo 2004 A rollout metaheuristic for job shop scheduling problems Ann Oper Res 131 215 235 1066.90035 10.1023/B:ANOR. 0000039520.24932.4b (Pubitemid 39187381)
- (2004) Annals of Operations Research , vol.131 , Issue.1-4 , pp. 215-235
- Meloni, C.¹ Pacciarelli, D.² Pranzo, M.³

12
- 5244278595
- A fast taboo search algorithm for the job shop problem
- 0880.90079 10.1287/mnsc.42.6.797
- E Nowicki C Smutnicki 1996 A fast taboo search algorithm for the job shop problem Manag Sci 42 797 812 0880.90079 10.1287/mnsc.42.6.797
- (1996) Manag Sci , vol.42 , pp. 797-812
- Nowicki, E.¹ Smutnicki, C.²

13
- 80051678087
- PhD thesis, University of Fribourg, Switzerland
- Pham DN (2008) Complex job shop scheduling: Formulations, algorithms and a healthcare application. PhD thesis, University of Fribourg, Switzerland
- (2008) Complex Job Shop Scheduling: Formulations, Algorithms and A Healthcare Application
- Pham, D.N.¹

14
- 0141636340
- A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage
- 1043.90034 10.1016/S0377-2217(02)00524-6
- HW Thornton JL Hunsucker 2004 A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage Eur J Oper Res 152 96 114 1043.90034 10.1016/S0377-2217(02)00524-6
- (2004) Eur J Oper Res , vol.152 , pp. 96-114
- Thornton, H.W.¹ Hunsucker, J.L.²

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