Cite
HARVARD Citation
Yang, D. et al. (2017). A note on a single-machine lot scheduling problem with indivisible orders. Computers & operations research. pp. 34-38. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Yang, D. et al. (2017). A note on a single-machine lot scheduling problem with indivisible orders. Computers & operations research. pp. 34-38. [Online].