Cite
HARVARD Citation
Liao, W. et al. (2020). Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem. Engineering optimization. 52 (4), pp. 687-700. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Liao, W. et al. (2020). Min–max regret criterion-based robust model for the permutation flow-shop scheduling problem. Engineering optimization. 52 (4), pp. 687-700. [Online].