SCOPUS 정보 검색 플랫폼

Archives of Control Sciences

Volumn 22, Issue 4, 2012, Pages 441-449

Multi-machine scheduling problem with setup times

(3) Bozejko, Wojciech a Uchronski, Mariusz b Wodecki, Mieczyslaw c

a WROCLAW UNIVERSITY OF TECHNOLOGY (Poland)

b Wroc aw Centre of Networking and Supercomputing (Poland)

c UNIVERSITY OF WROC AW (Poland)

Author keywords

Block properties; Discrete optimization; Jobs scheduling

Indexed keywords

MACHINERY; OPTIMIZATION; SCHEDULING; TABU SEARCH;

BLOCK PROPERTIES; CONSTRUCTION PROCESS; CRITICAL PATHS; DISCRETE OPTIMIZATION; FLEXIBLE JOB-SHOP PROBLEM; JOBS SCHEDULING; MULTI MACHINE SCHEDULING; TABU SEARCH METHOD;

JOB SHOP SCHEDULING;

EID: 84872069456 PISSN: 12302384 EISSN: None Source Type: Journal
DOI: 10.2478/v10170-011-0034-y Document Type: Article

Times cited : (2)

References (9)

1
- 78650280956
- An algorithm for solving the machine sequencing problem with parallel machines
- A. ADRABI'N SKI andM. WODECKI: An algorithm for solving the machine sequencing problem with parallel machines. Zastosowania Matematyki XVI, 3 (1979), 513- 541.
- (1979) Zastosowania Matematyki , vol.14 , Issue.3 , pp. 513-541
- Adrabi'N Ski, A.¹ Wodecki, M.²

2
- 77955308077
- Parallel hybrid metaheuristics for the flexible job shop problem
- W. BOZ EJKO, M. UCHRO'N SKI and M. WODECKI: Parallel hybrid metaheuristics for the flexible job shop problem. Computers & Industrial Engineering, 59 (2010), 323-333.
- (2010) Computers & Industrial Engineering , vol.59 , pp. 323-333
- Boz Ejko, W.¹ Uchro'N Ski, M.² Wodecki, M.³

3
- 34250084648
- Routing and scheduling in a flexible job shop by tabu search
- P. BRANDIMARTE: Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41 (1993), 157-183.
- (1993) Annals of Operations Research , vol.41 , pp. 157-183
- Brandimarte, P.¹

4
- 84872056371
- Solving algorithm of general sequencing problem with parallel machines
- (in Polish)
- J. GRABOWSKI, A. ADRABÍNSKI and M. WODECKI: Solving algorithm of general sequencing problem with parallel machines. Conf. on Mathematical Programming in Economical Research, Jachranka, Poland, 1978, 41-53, (in Polish).
- (1978) Conf. on Mathematical Programming in Economical Research, Jachranka, Poland , pp. 41-53
- Grabowski, J.¹ Adrabínski, A.² Wodecki, M.³

5
- 0003390495
- G.Gutin and A.Punnen, (Eds), The Traveling Salesman Problem and its Variations Kluwer
- D. JOHNSON and L. MCGEOCH: Experimental analysis of heuristics for the STST. In G.Gutin and A.Punnen, (Eds), The Traveling Salesman Problem and its Variations, Kluwer, 2002, 369-444.
- (2002) Experimental Analysis of Heuristics for the STST , pp. 369-444
- Johnson, D.¹ McGeoch, L.²

6
- 5244278595
- A fast tabu search algorithm for the job shop problem
- E. NOWICKI and C. SMUTNICKI: A fast tabu search algorithm for the job shop problem. Management Science, 42 (1996), 797-813.
- (1996) Management Science , vol.42 , pp. 797-813
- Nowicki, E.¹ Smutnicki, C.²

7
- 84872089644
- (ed. Elmaghraby S.E.) Springer Verlag, Berlin
- S.S. PANWALKAR, R.A. DUDEK and M.L. SMITH: Sequencing research and the industrial scheduling problem. Symp. on the theory of scheduling and its applications, (ed. Elmaghraby S.E.), Springer-Verlag, Berlin, 1973.
- (1973) Sequencing Research and the Industrial Scheduling Problem. Symp. on the Theory of Scheduling and Its Applications
- Panwalkar, S.S.¹ Dudek, R.A.² Smith, M.L.³

8
- 40249118429
- A genetic algorithm for the flexible job-schop scheduling problem
- F. PEZZELLA, G. MORGANTI and G. CIASCHETTI: A genetic algorithm for the Flexible Job-schop Scheduling Problem. Comp.&Oper. Res., 35 (2008), 3202-3212.
- (2008) Comp.&Oper. Res , vol.35 , pp. 3202-3212
- Pezzella, F.¹ Morganti, G.² Ciaschetti, G.³

9
- 0003438602
- Englewood Cliffs NJ Prentice-Hall
- M. PINEDO: Scheduling: theory, algorithms and systems. Englewood Cliffs, NJ: Prentice-Hall, 2002.
- (2002) Scheduling: Theory Algorithms and Systems
- Pinedo, M.¹

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