Supply Chain Scheduling with Transportation Cost on a Single Machine

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Helen Zhang and David Jin

Pages:

106-109

DOI:

10.4028/www.scientific.net/AMR.382.106

Citation:

J. Fan "Supply Chain Scheduling with Transportation Cost on a Single Machine", Advanced Materials Research, Vol. 382, pp. 106-109, 2012

Online since:

November 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.