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

DOI10.1142/S0217595916500391zbMath1354.90019OpenAlexW2522680653MaRDI QIDQ5506759

Chin-Chia Wu, Shang-Chia Liu

Publication date: 16 December 2016

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595916500391

zbMATH Keywords

approximation algorithminventory controlshortest path problemFPTASsupply chain schedulingoutsourcing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
• Supply chain scheduling to minimize holding costs with outsourcing
• An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• Approximability of total weighted completion time with resource consuming jobs
• An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
• Futures and Option Contracts of the Supply Chain Influenced by e-Business Market
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Supply Chain Coordination Under Ramp-Type Price and Effort Induced Demand Considering Revenue Sharing Contract