scholarly journals A two-stage stochastic supply chain scheduling problem with production in cellular manufacturing environment: A case study

2021 ◽  
Vol 0 (0) ◽  
pp. 0-0
Author(s):  
Bahman Esmailnezhad ◽  
Mohammad Saidi-Mehrabad
Keyword(s):  
Supply Chain ◽  
Cellular Manufacturing ◽  
Scheduling Problem ◽  
Supply Chain Scheduling ◽  
Manufacturing Environment ◽  
Two Stage

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.

Supply Chain Scheduling with Transportation Cost on a Single Machine

2011 ◽  
Vol 382 ◽  
pp. 106-109
Author(s):  
Jing Fan
Keyword(s):  
Supply Chain ◽  
Single Machine ◽  
System Integration ◽  
Production Cost ◽  
Dynamic Programming Algorithm ◽  
Optimal Solution ◽  
Transportation Cost ◽  
Programming Algorithm ◽  
Scheduling Problem ◽  
Supply Chain Scheduling

Supply chain scheduling problem is raised from modern manufacturing system integration, in which manufacturers not only process orders but also transport products to customer’s location. Therefore, the system ought to consider how to appropriately send finished jobs in batches to reduce transportation costs while considering the processing sequence of jobs to reduce production cost. This paper studies such a supply chain scheduling problem that one manufacturer produces with a single machine and deliveries jobs within limited transportation times to one customer. The objective function is to minimize the total sum of production cost and transportation cost. The NP hard property of the problem is proved in the simpler way, and the pseudo-dynamic programming algorithm in the literature is modified as the MDP algorithm to get the optimal solution which is associated with the total processing times of jobs.

Sign in / Sign up

Export Citation Format

Share Document