A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing-Reference-Cited by-同舟云学术

A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing

Published:2016-10 Issue:05 Volume:33 Page:1650039
ISSN:0217-5959
Container-title:Asia-Pacific Journal of Operational Research
language:en
Short-container-title:Asia Pac. J. Oper. Res.

Author:

Liu Shang-Chia¹,Wu Chin-Chia²

Affiliation:

1. Department of Business Administration, Fu Jen Catholic University, New Taipei City, Taiwan

2. Department of Statistics, Feng Chia University, Taichung, Taiwan

Abstract

This paper addresses a scheduling problem in a flexible supply chain where the jobs can be either processed in house, or outsourced to a third-party supplier with the goal of minimizing the sum of holding and delivery costs subject to an upper bound on the outsourcing cost. The problem with identical job processing times has been proved as binary [Formula: see text]-hard one and a fully polynomial time approximation scheme (FPTAS) that runs in [Formula: see text] time has also been given. The aim of this paper is to derive a more effective FPTAS running in [Formula: see text] time for this problem.

Publisher

World Scientific Pub Co Pte Lt

Subject

Management Science and Operations Research,Management Science and Operations Research

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0217595916500391

Reference19 articles.

1. Futures and Option Contracts of the Supply Chain Influenced by e-Business Market

2. Techniques for scheduling with rejection

3. An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set

4. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

5. A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs