Cite

HARVARD Citation

    Ribas, I. et al. (2019). An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem. Expert systems with applications. pp. 347-361. [Online]. 
  
Back to record