Two-stage production scheduling with an outsourcing option

This paper considers a two-stage production scheduling problem in which each activity requires two operations to be processed in stages 1 and 2, respectively. There are two options for processing each operation: the first is to produce it by utilizing in-house resources, while the second is to outsource it to a subcontractor. For in-house operations, a schedule is constructed and its performance is measured by the makespan, that is, the latest completion time of operations processed in-house. Operations by subcontractors are instantaneous but require outsourcing cost. The objective is to minimize the weighted sum of the makespan and the total outsourcing cost. This paper analyzes how the model's computational complexity changes according to unit outsourcing costs in both stages and describes the boundary between NP-hard and polynomially solvable cases. Finally, this paper presents an approximation algorithm for one NP-hard case.

[1]  Chiung Moon,et al.  Advanced planning and scheduling with outsourcing in manufacturing supply chain , 2002 .

[2]  Jian Yang,et al.  A Production-Inventory System with Markovian Capacity and Outsourcing Option , 2005, Oper. Res..

[3]  Xiangtong Qi,et al.  Coordinated Logistics Scheduling for In-House Production and Outsourcing , 2008, IEEE Transactions on Automation Science and Engineering.

[4]  Johnny C. Ho,et al.  Generating Pareto schedules with outsource and internal parallel resources , 2006 .

[5]  A. P. Muhlemann,et al.  Subcontracting within the supply chain for electronics assembly manufacture , 1997 .

[6]  Alper Atamtürk,et al.  Capacity Acquisition, Subcontracting, and Lot Sizing , 2001, Manag. Sci..

[7]  James R. Bradley.  A Brownian Approximation of a Production-Inventory System with a Manufacturer That Subcontracts , 2004, Oper. Res..

[8]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[9]  Xiangtong Qi.  Two-stage production scheduling with an option of outsourcing from a remote supplier , 2009 .

[10]  J. Will M. Bertrand,et al.  A study of simple rules for subcontracting in make-to-order manufacturing , 2001, Eur. J. Oper. Res..

[11]  Stanisław Zdrzałka,et al.  A two-machine flow shop scheduling problem with controllable job processing times , 1988 .

[12]  Eugeniusz Nowicki.  An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times , 1993 .

[13]  Ik Sun Lee,et al.  Single machine scheduling with outsourcing allowed , 2008 .

[14]  Ik Sun Lee,et al.  Minimizing due date related measures for a single machine scheduling problem with outsourcing allowed , 2008, Eur. J. Oper. Res..

[15]  Jinwoo Park,et al.  A new approach to job shop scheduling problems with due date constraints considering operation subcontracts , 2005 .

[16]  Zhi-Long Chen,et al.  Scheduling with subcontracting options , 2008 .

[17]  Patrick T. Harker,et al.  Competition and Outsourcing with Scale Economies , 2002, Manag. Sci..