Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/47114
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?
URI: http://hdl.handle.net/10397/47114
Appears in Collections:Conference Paper

Show full item record

Page view(s)

31
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check



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