A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion

From MaRDI portal
Publication:2297561

DOI10.1016/j.cor.2019.104839zbMath1458.90349OpenAlexW2985844211WikidataQ126845547 ScholiaQ126845547MaRDI QIDQ2297561

Yuli Zhang, Vahid Riahi, Raymond Chiong

Publication date: 20 February 2020

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.104839




Related Items (6)




Cites Work




This page was built for publication: A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion