Supply Chain Scheduling on a Single Machine with Availability Constraint

Article Preview

Abstract:

In the actual industrial engineering, the machine may be checked to ensure that they can work efficiently. Thus, the machine has an unavailable interval so that the job could be interrupted. When the machine becomes available again, the job can be resumed processing. When the job is completed, it can be delivered in batches to one customer by vehicles with capacity constraint. Our goal is to minimize the sum of arrival time of batches and the total delivery cost. We develop an optimal polynomial time algorithm and give an instance to verify the algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

4736-4739

Citation:

Online since:

August 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] N. G. Hall, C. N. Potts: Operations Research, Vol. 51(2003), pp.566-584.

Google Scholar

[2] Z. L. Chen, G. L. Vairaktarakis: Management Science, Vol. 51 (2005), pp.614-628.

Google Scholar

[3] N. G. Hall, C. N. Potts: Annals of Operations Research, Vol. 135 (2005), pp.41-64.

Google Scholar

[4] C. L. Li, G. L. Vairaktarakis, C. Y. Lee: European Journal of Operational Research, Vol. 164 (2005), pp.39-51.

Google Scholar

[5] C. Y. Lee: Journal of Global Optimization, Vol. 9 (1996), pp.363-382.

Google Scholar

[6] Z. L. Chen: Operations Research, Vol. 58 (2010), pp.130-148.

Google Scholar