1. T.C.E. Cheng, G. Wang, Customer order scheduling on multiple facilities, Working Paper No. 11/98-9, Faculty of Business and Information Systems, The Hong Kong Polytechnic University, Hong Kong, 1999.
2. Introduction to Algorithms;Cormen,2001
3. Minimizing total tardiness on one machine is NP-hard;Du;Mathematics of Operations Research,1990
4. The multidimensional 0–1 Knapsack problem: An overview;Fréville;European Journal of Operational Research,2004
5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979