Journal of Combinatorial Optimization

, Volume 26, Issue 3, pp 489–498 | Cite as

Single machine scheduling problems with subcontracting options



In this paper, we study a scheduling model as follows: there are n jobs which can be processed in house on a single machine or subcontracted to a subcontractor. If a job is subcontracted, its processing cost is different from the in-house cost and its delivery lead time is a stepwise function of the total processing time of outsourced jobs. Two objective functions are studied (1) to minimize the weighted sum of the maximal completion time and the total processing cost and (2) to minimize the weighted sum of the number of tardy jobs and the total processing cost. For the first problem, we prove that it is NP-hard and get a pseudo-polynomial time algorithm. For the second problem, we prove that it is NP-hard and get a pseudo-polynomial time algorithm for a special case.


Scheduling Subcontracting Computational complexity 



This work has been financed by Shanghai Leading Academic Discipline Project (S30104).


  1. Chen Z-L, Li C-L (2008) Scheduling with subcontracting options. IIE Trans 40:1171–1184 CrossRefGoogle Scholar
  2. Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman, Bedford MATHGoogle Scholar
  3. Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin CrossRefMATHGoogle Scholar
  4. Lee IKS, Sung CS (2008) Single machine scheduling with outsourcing allowed. Int J Prod Econ 111:623–634 CrossRefGoogle Scholar
  5. Moore JM (1968) An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manag Sci 15:102–109 CrossRefMATHGoogle Scholar
  6. Qi X (2008) Coordinated logistics scheduling for in-house production and outsourcing. IEEE Trans Autom Sci Eng 5:188–192 CrossRefGoogle Scholar
  7. Qi X (2009) Two stage production scheduling with an option of outsourcing from a remote supplier. J Syst Sci Syst Eng 8:1–15 CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of MathematicsShanghai UniversityShanghaiChina

Personalised recommendations