Bargaining Based Supply Chain Scheduling

2012 ◽  
Vol 220-223 ◽  
pp. 299-303
Author(s):  
Tian Tian Chang ◽  
Li Li Wang ◽  
Ji Hui Zhang ◽  
Qing Yue Ma
Keyword(s):  
Supply Chain ◽  
Nash Bargaining ◽  
Bargaining Solution ◽  
Bargaining Model ◽  
Scheduling Problem ◽  
Bargaining Theory ◽  
Supply Chain Scheduling ◽  
Manufacturing Efficiency ◽  
Cooperation Mechanism ◽  
Nash Bargaining Theory

Coordination across the supply chain improves the manufacturing efficiency a lot. To provide a rational cooperation mechanism for supply chain scheduling, a bargaining model was established on the basis of the Nash bargaining theory. The solution of the model draws forth a new scheduling problem with multi-objective product. A polynomial heuristic was designed to find the near-optimal bargaining solution under the assembly circumstance.

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

2016 ◽  
Vol 33 (05) ◽  
pp. 1650039
Author(s):  
Shang-Chia Liu ◽  
Chin-Chia Wu
Keyword(s):  
Supply Chain ◽  
Approximation Scheme ◽  
Third Party ◽  
Scheduling Problem ◽  
Polynomial Time Approximation Scheme ◽  
Supply Chain Scheduling ◽  
Time Approximation ◽  
Holding Costs ◽  
Processing Times ◽  
Delivery Costs

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.

Sign in / Sign up

Export Citation Format

Share Document