Title: Minimising the total weighted tardiness for non-identical parallel batch processing machines with job release times and non-identical job sizes

Authors: Fuh-Der Chou

Addresses: Department of Industrial Management, Ching Yun University, No. 229, Jiansing Road, Jung-Li, Tao Yuan, Taiwan

Abstract: This paper investigates a scheduling problem of non-identical parallel batch processing machines (PBPMs) with job release times and non-identical job sizes, in which jobs come from compatible product families, to minimise the total weighted tardiness (TWT). Only a few studies on PBPM problems aimed at minimising the TWT are concerned with compatible product families. A mixed integer programming (MIP) model is formulated, and a multi-MIP approach is proposed based on this model. Given the computational difficulty in directly solving the multi-MIP approach, several heuristics are developed based on dispatching rules, dynamic programming methods, and simulated annealing (SA) algorithms. Computational results reveal that the proposed SA algorithms can obtain the optimal solutions for 99.8% of the tested small-scale (n = 10) problems and they significantly outperform the dispatching rule heuristics because the solution space is enlarged by the composite list and swapping method. [Received 11 May 2011; Revised 9 September 2011; Revised 31 December 2011; Accepted 16 January 2012]

Keywords: parallel batch processing machines; PBPMs; total weighted tardiness; TWT; compatible product families; job release times; non-identical job sizes; scheduling; mixed integer programming; MIP; dispatching rules; dynamic programming; simulated annealing.

DOI: 10.1504/EJIE.2013.057380

European Journal of Industrial Engineering, 2013 Vol.7 No.5, pp.529 - 557

Received: 08 May 2021
Accepted: 12 May 2021

Published online: 28 Oct 2013 *

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