Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Single machine serial batching and scheduling problem with deteriorating jobs for production-distribution supply chain under discrete due-date constraints

Single machine serial batching and scheduling problem with deteriorating jobs for... We study serial batching scheduling of deteriorating jobs in a production-delivery supply chain to minimise the total logistics cost. Each job should be delivered to customer within its guarantee period. We define that if a job which is finished before its departure date or delivered to the customer before its due date will incur respectively a work-in-process or customer inventory cost. We first formulate the problem as a general model and prove its complexity in a general way. Then we study a special case of the problem and propose a tabu algorithm for solving it. In order to evaluate the proposed tabu algorithm, we compare it with CPLEX solver for small size problem instances, and with a lower bound for large size problem instances. The results of experiments indicate that the proposed tabu algorithm is efficient for the randomly generated problems in terms of both quality and time efficiency. [Received 31 January 2015; Accepted 16 September 2015] Keywords: batching and scheduling; tabu algorithm; deterioration; Lagrangian relaxation. Reference to this paper should be made as follows: Wang, D., Zhao, X. and Zhu, K. (2015) `Single machine serial batching and scheduling problem with deteriorating jobs for production-distribution supply chain under http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Manufacturing Research Inderscience Publishers

Single machine serial batching and scheduling problem with deteriorating jobs for production-distribution supply chain under discrete due-date constraints

Download PDF
25 pages

Loading next page...
 
/lp/inderscience-publishers/single-machine-serial-batching-and-scheduling-problem-with-eYE0C0XRfC

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © 2015 Inderscience Enterprises Ltd.
ISSN
1750-0591
eISSN
1750-0605
DOI
10.1504/IJMR.2015.074822
Publisher site
See Article on Publisher Site

Abstract

We study serial batching scheduling of deteriorating jobs in a production-delivery supply chain to minimise the total logistics cost. Each job should be delivered to customer within its guarantee period. We define that if a job which is finished before its departure date or delivered to the customer before its due date will incur respectively a work-in-process or customer inventory cost. We first formulate the problem as a general model and prove its complexity in a general way. Then we study a special case of the problem and propose a tabu algorithm for solving it. In order to evaluate the proposed tabu algorithm, we compare it with CPLEX solver for small size problem instances, and with a lower bound for large size problem instances. The results of experiments indicate that the proposed tabu algorithm is efficient for the randomly generated problems in terms of both quality and time efficiency. [Received 31 January 2015; Accepted 16 September 2015] Keywords: batching and scheduling; tabu algorithm; deterioration; Lagrangian relaxation. Reference to this paper should be made as follows: Wang, D., Zhao, X. and Zhu, K. (2015) `Single machine serial batching and scheduling problem with deteriorating jobs for production-distribution supply chain under

Journal

International Journal of Manufacturing Research – Inderscience Publishers

Published: Jan 1, 2015

There are no references for this article.