Supply chain scheduling to minimize holding costs with outsourcing

Esaignani Selvarajah () and Rui Zhang ()

Annals of Operations Research, 2014, vol. 217, issue 1, 479-490

Abstract: This paper addresses a scheduling problem in a flexible supply chain, in which the jobs can be either processed in house, or outsourced to a third-party supplier. The goal is to minimize the sum of holding and delivery costs. This problem is proved to be strongly $\mathcal{NP}$ -hard. Consider two special cases, in which the jobs have identical processing times. For the problem with limited outsourcing budgets, a $\mathcal{NP}$ -hardness proof, a pseudo-polynomial algorithm and a fully polynomial time approximation scheme are presented. For the problem with unlimited outsourcing budgets, the problem is shown to be equivalent to the shortest path problem, and therefore it is in class $\mathcal{P}$ . This shortest-path-problem solution approach is further shown to be applicable to a similar but more applicable problem, in which the number of deliveries is upper bounded. Copyright Springer Science+Business Media New York 2014

Keywords: Supply chain scheduling; Outsourcing; Inventory control; FPTAS; Approximation algorithm; Shortest path problem (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-013-1522-1 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:217:y:2014:i:1:p:479-490:10.1007/s10479-013-1522-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-013-1522-1

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().