Single machine scheduling with outsourcing allowed

Cited 52 time in webofscience Cited 0 time in scopus
  • Hit : 640
  • Download : 0
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. (C) 2007 Elsevier B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2008-02
Language
English
Article Type
Article
Keywords

SUPPLY CHAIN; DECISION; COORDINATION; CAPACITY; MODELS; SYSTEM; COST

Citation

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, v.111, no.2, pp.623 - 634

ISSN
0925-5273
DOI
10.1016/j.ijpe.2007.02.036
URI
http://hdl.handle.net/10203/87870
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 52 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0