Single machine scheduling problems with subcontracting options

  • Authors:

  • Weiya Zhong;Zhiming Huo

  • Affiliations:

  • Department of Mathematics, Shanghai University, Shanghai, China;Department of Mathematics, Shanghai University, Shanghai, China

  • Venue:
  • Journal of Combinatorial Optimization
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.