Please use this identifier to cite or link to this item:
Title: Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem without missing operations
Authors: Cheng, TCE 
Ng, CT 
Yuan, JJ
Issue Date: 2003
Source: Proceedings of the Second Global Conference on Business & Economics, London, England, 5-7 July 2003 How to cite?
Appears in Collections:Conference Paper

Show full item record

Page view(s)

Last Week
Last month
Citations as of Aug 21, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.