Single machine scheduling with outsourcing allowed

• Published in: International journal of production economics Vol. 111; no. 2; pp. 623 - 634
• Main Authors: Lee, Ik Sun, Sung, C.S.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.02.2008; Elsevier; Elsevier Sequoia S.A
• Series: International Journal of Production Economics
• Subjects: Algorithms; Branch & bound algorithms; Branch-and-bound; Heuristic; Job shops; Outsourcing; Outsourcing strategy; Production scheduling; Single-machine scheduling; Studies; Single-machine scheduling; Branch-and-bound; Outsourcing strategy
• ISSN: 0925-5273; 1873-7579
• DOI: 10.1016/j.ijpe.2007.02.036

This paper considers a single-machine scheduling problem with outsourcing allowed, where each job can be either processed on an in-house single-machine or outsourced. Outsourcing is commonly required as a way to improve productivity effectively and efficiently in various companies, especially, including electronics industries and motor industries. The objective is to minimize the weighted sum of the outsourcing cost and the scheduling measure represented by the sum of completion times, subject to outsourcing budget. In the problem analysis, it is proved that the proposed problem is NP-hard in the ordinary sense, and some solution properties are characterized. Therewith, two associated heuristic algorithms and the branch-and-bound algorithm are derived. Numerical experiments are conducted to evaluate the performance of the derived algorithms, and some managerial insights of the heuristic algorithms are provided.