全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

The Supplying Chain Scheduling with the Cost Constraint and Subcontracting

DOI: 10.1155/2014/490987

Full-Text   Cite this paper   Add to My Lib

Abstract:

We propose an analytical scheduling model with subcontracting. Each job can be processed either on a single machine at a manufacturer or outsourced to a subcontractor, possibly at a higher cost. For a given set of jobs, the decisions the manufacturer needs to make include the selection of a subset of jobs to be outsourced and the schedule of all the jobs. The objective functions are to minimize the commonly used scheduling measures, subject to a constraint on the total production and subcontracting cost. We show the NP-hardiness for the problems with different objective functions and develop dynamic programming algorithms for solving them. 1. Introduction and Problem Description With widespread globalization, subcontracting is widespread in many industries. Subcontracting is the procurement of an item or service that a firm is normally capable of producing using its own facilities. Subcontracting can be used as a strategic tool to reduce operation cost and as a means to hedge against the capacity shortage when facing a large demand. When a firm subcontracts out some orders, this allows it to concentrate on its core competencies and improve its response to customer demand. Furthermore, subcontracting lowers investment requirements and the financial risk of the firm. However, in making subcontracting decisions, many factors need to be taken into account, such as production cost, subcontracting cost, customer demand, and delivery lead times. Obviously, analytical models and problem-solving tools are needed if a manufacturer is to optimize the tradeoffs from those factors. In this paper, we propose an analytical scheduling model for a firm with an option of subcontracting. In our model, we assume that there is a single machine at the manufacturer’s plant and there is a subcontractor, who has a sufficient number of identical parallel machines, such that each of these machines will handle at most one job, possibly at a higher cost. Each job can be processed either at the manufacturer’s plant or outsourced to a subcontractor. The objective functions are to minimize the common scheduling measures, subject to a constraint on the total production and subcontracting cost. Given a set of orders, the manufacturer needs to determine which orders should be scheduled in-house and which should be outsourced. While controlling the production and subcontracting costs, the manufacturer needs to consider in-house scheduling and subcontracting simultaneously. The study of subcontracting under machine scheduling models just started recently. Chung et al. [1] considered a job

References

[1]  D. Chung, K. Lee, K. Shin, and J. Park, “A new approach to job shop scheduling problems with due date constraints considering operation subcontracts,” International Journal of Production Economics, vol. 98, no. 2, pp. 238–250, 2005.
[2]  J. W. M. Bertrand and V. Sridharan, “A Study of simple rules for subcontracting in make-to-order manufacturing,” European Journal of Operational Research, vol. 128, no. 3, pp. 509–531, 2001.
[3]  X. T. Qi, “Outsourcing and production scheduling for a two-stage flow shop,” International Journal of Production Economics, vol. 129, no. 1, pp. 43–50, 2011.
[4]  Z.-L. Chen and C.-L. Li, “Scheduling with subcontracting options,” IIE Transactions, vol. 40, no. 12, pp. 1171–1184, 2008.
[5]  Y. N. Sotskov, “Mixed multigraph approach to scheduling jobs on machines of different types,” Optimization, vol. 42, no. 3, pp. 245–280, 1997.
[6]  J. A. van Mieghem, “Coordinating investment, production, and subcontracting,” Management Science, vol. 45, no. 7, pp. 954–971, 1999.
[7]  A. Atamtürk and D. S. Hochbaum, “Capacity acquisition, subcontracting, and lot sizing,” Management Science, vol. 47, no. 8, pp. 1081–1100, 2001.
[8]  J. Yang, X. Qi, and Y. Xia, “A production-inventory system with Markovian capacity and outsourcing option,” Operations Research, vol. 53, no. 2, pp. 328–349, 2005.
[9]  R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979.
[10]  M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, Calif, USA, 1979.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133