Cite
HARVARD Citation
Błażewicz, J. et al. (2019). Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work. Engineering optimization. 51 (7), pp. 1279-1280. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Błażewicz, J. et al. (2019). Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work. Engineering optimization. 51 (7), pp. 1279-1280. [Online].