메뉴 건너뛰기




Volumn 155, Issue 2, 2004, Pages 380-401

A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities

Author keywords

Buffer constraints; Flowshop scheduling; Minimizing makespan; Parallel machines

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MULTIPROCESSING PROGRAMS; SCHEDULING; VECTORS;

EID: 1642518689     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00873-1     Document Type: Article
Times cited : (98)

References (10)
  • 1
    • 0016952078 scopus 로고
    • The complexity of flowshop and jobshop scheduling
    • Garey M.R., Johnson D.S., Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research. 1(2):1976;117-129 International Journal of Production Research. 34:1976;1399-1415.
    • (1976) Mathematics of Operations Research , vol.1 , Issue.2 , pp. 117-129
    • Garey, M.R.1    Johnson, D.S.2    Sethi, R.3
  • 2
    • 0016952078 scopus 로고
    • Garey M.R., Johnson D.S., Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research. 1(2):1976;117-129 International Journal of Production Research. 34:1976;1399-1415.
    • (1976) International Journal of Production Research , vol.34 , pp. 1399-1415
  • 3
    • 0032683531 scopus 로고    scopus 로고
    • Scheduling flowshops with finite buffers and sequence dependent setup times
    • Norman B.A. Scheduling flowshops with finite buffers and sequence dependent setup times. Computers and Industrial Engineering. 36:1999;163-177.
    • (1999) Computers and Industrial Engineering , vol.36 , pp. 163-177
    • Norman, B.A.1
  • 4
    • 0032649738 scopus 로고    scopus 로고
    • The permutation flow shop with buffers: A tabu search approach
    • Nowicki E. The permutation flow shop with buffers: A tabu search approach. European Journal of Operational Research. 116:1999;205-219.
    • (1999) European Journal of Operational Research , vol.116 , pp. 205-219
    • Nowicki, E.1
  • 6
    • 0027615366 scopus 로고
    • A scheduling algorithm for flexible flow lines with limited intermediate buffers
    • Sawik T.J. A scheduling algorithm for flexible flow lines with limited intermediate buffers. Applied Stochastic Models and Data Analysis. 9:1993;127-138.
    • (1993) Applied Stochastic Models and Data Analysis , vol.9 , pp. 127-138
    • Sawik, T.J.1
  • 7
    • 84877027692 scopus 로고
    • Scheduling flexible flow lines with no in-process buffers
    • Sawik T.J. Scheduling flexible flow lines with no in-process buffers. International Journal of Production Research. 33(5):1995;1357-1367.
    • (1995) International Journal of Production Research , vol.33 , Issue.5 , pp. 1357-1367
    • Sawik, T.J.1
  • 10
    • 0024016313 scopus 로고
    • An adaptable scheduling algorithm for flexible flow lines
    • Wittrock R.J. An adaptable scheduling algorithm for flexible flow lines. Operations Research. 36:1988;445-453.
    • (1988) Operations Research , vol.36 , pp. 445-453
    • Wittrock, R.J.1


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