메뉴 건너뛰기




Volumn , Issue , 2007, Pages 809-813

Scheduling hybrid flow shop for minimizing total weight completion time

Author keywords

HFS; Tabu search

Indexed keywords

COMPUTATIONAL EFFICIENCY; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; SCHEDULING; SCHEDULING ALGORITHMS; TABU SEARCH;

EID: 40649117464     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICAL.2007.4338675     Document Type: Conference Paper
Times cited : (1)

References (6)
  • 1
    • 26444492122 scopus 로고    scopus 로고
    • A. Scheduling two-stage hybrid flow shop with availability constraints
    • H. Allaoui and A. Artiba, "A. Scheduling two-stage hybrid flow shop with availability constraints," Computer and Operations Research, vol. 33, no. 5, pp. 1399-1419, 2006.
    • (2006) Computer and Operations Research , vol.33 , Issue.5 , pp. 1399-1419
    • Allaoui, H.1    Artiba, A.2
  • 2
    • 0031543097 scopus 로고    scopus 로고
    • Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
    • JND, Gupta, AMA. Hariri, and CN. Potts, "Scheduling a two-stage hybrid flow shop with parallel machines at the first stage," Annals of Operations Research, vol. 69, pp. 171 -191, 1997.
    • (1997) Annals of Operations Research , vol.69 , pp. 171-191
    • Gupta, J.N.D.1    Hariri, A.M.A.2    Potts, C.N.3
  • 5
    • 0032050653 scopus 로고    scopus 로고
    • The flow shop with parallel machine: A tabu search approach
    • E. Nowicki and C. Smuinicki, "The flow shop with parallel machine: A tabu search approach," European Journal of Operational Research, vol. 106, pp.226-253, 1998
    • (1998) European Journal of Operational Research , vol.106 , pp. 226-253
    • Nowicki, E.1    Smuinicki, C.2
  • 6
    • 0346438804 scopus 로고    scopus 로고
    • Heuristics for minimizing total weighted tardiness in flexible flow shops
    • Y. Yang, S. Kreip, and M. Pinedo. "Heuristics for minimizing total weighted tardiness in flexible flow shops," Journal of Scheduling, vol. 3, pp.89-108, 2000
    • (2000) Journal of Scheduling , vol.3 , pp. 89-108
    • Yang, Y.1    Kreip, S.2    Pinedo, M.3


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