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

Authors: Deyun Wang; Xiaohan Zhao; Kejun Zhu

Addresses: Center for Digital Business and Intelligent Management, School of Economics and Management, China University of Geosciences (Wuhan), Lumo Rd., Wuhan (430074), China ' Center for Digital Business and Intelligent Management, School of Economics and Management, China University of Geosciences (Wuhan), Lumo Rd., Wuhan (430074), China ' Center for Digital Business and Intelligent Management, School of Economics and Management, China University of Geosciences (Wuhan), Lumo Rd., Wuhan (430074), China

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 solution quality and time efficiency. [Received 31 January 2015; Accepted 16 September 2015]

Keywords: serial batching; single machine scheduling; tabu search; deterioration; Lagrangian relaxation; deteriorating jobs; supply chain management; SCM; discrete due dates; logistics cost.

DOI: 10.1504/IJMR.2015.074822

International Journal of Manufacturing Research, 2015 Vol.10 No.4, pp.346 - 370

Available online: 19 Feb 2016 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article