Cite

HARVARD Citation

    Wu, C. et al. (2020). A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration. Engineering optimization. 52 (6), pp. 1009-1036. [Online]. 
  
Back to record