메뉴 건너뛰기




Volumn , Issue , 2006, Pages

A heuristic method for a flexible flow line with unrelated parallel machines problem

Author keywords

Bottleneck; Flexibile flow line; Total flow time; Unrelated parallel machines

Indexed keywords

HEURISTIC ALGORITHMS; LOGIC PROGRAMMING; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING;

EID: 34547296610     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RAMECH.2006.252673     Document Type: Conference Paper
Times cited : (5)

References (8)
  • 2
    • 0032099023 scopus 로고    scopus 로고
    • A tabu search based heuristic for a flexible flow line with minimum flow time criterion
    • C. L. Chen, J. M. Usher and N. Palanimuthu, "A tabu search based heuristic for a flexible flow line with minimum flow time criterion," International Journal of Industrial Engineering, Vol. 5, 157-168, 1998.
    • (1998) International Journal of Industrial Engineering , vol.5 , pp. 157-168
    • Chen, C.L.1    Usher, J.M.2    Palanimuthu, N.3
  • 4
    • 10644277097 scopus 로고    scopus 로고
    • Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines
    • C. Y. Low, "Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines," Computers and Operations Research, Vol. 32, 2013-2025, 2005.
    • (2005) Computers and Operations Research , vol.32 , pp. 2013-2025
    • Low, C.Y.1
  • 8
    • 0008264656 scopus 로고    scopus 로고
    • Comparison of scheduling rules in a flow shop with multiple processors: A simulation
    • S. A. Brah, and G. E. Wheeler, "Comparison of scheduling rules in a flow shop with multiple processors: A simulation," Simulation, Vol. 71, 302-311, 1998.
    • (1998) Simulation , vol.71 , pp. 302-311
    • Brah, S.A.1    Wheeler, G.E.2


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