ZHONG Wei-Ya, LIU Xiao-Lei, Huo-Zhi-Ming. A Single Machine Scheduling Problem with Subcontracting Options[J]. Operations Research Transactions, 2012, 16(1): 121-128.
Chen Z L, Li C L. Scheduling with subcontracting options [J]. IIE Transactions, 2008, 40: 1171-1184. Lee IK S, Sung C S. Single machine scheduling with outsourcing allowed [J]. International Journal of Production Economics, 2008, 111: 623-634. Qi X. Coordinated logistics scheduling for in-house production and outsourcing [J]. IEEE Transactions on Automation Science and Engineering, 2008, 5: 188-192. Qi X. Two-stage production scheduling with an option of outsourcing from a remote supplier [J]. Journal of Systems Science and Systems Engineering, 2009, 8: 1-15. Kellerer H, Pferschy U, Pisinger D. Knapsack Problems [M]. Berlin: Springer, 2004. Kellerer H, Pferschy U. A new fully polynomial approximation scheme for the knapsack problem [J]. Lecture Notes in Computer Science, 1998, 144: 123-134. Gens G V, Levner E V. Computational complexity of approximation algorithms for combinatorial problems [J]. Lecture Notes in Computer Science, 1979, 74: 292-300.