Title: Completion time variance and the product rate variation problem

Authors: Amrutha Renganathan; G. Srinivasan

Addresses: Integrated Programme in Management, IIM Indore, Rau Pithampur Road, Indore, Madhya Pradesh 453556, India ' Department of Management Studies, IIT Madras, Chennai 600036, India

Abstract: Just-in-time manufacturing necessitates finding short repeated sequences of products. The literature addressed this mixed model scheduling objective using the product rate variation (PRV), which maximises the deviation between the actual proportions and ideal proportions of jobs in the sequence. Researchers have reported application of PRV minimisation in manufacturing as well as in service industry. In this paper, we address this problem considering the completion times of the jobs in the sequence instead of the PRV, and show instances where maximising the sum of completion time variances (SCTVs) is an effective alternative to PRV for the mixed model sequencing problem. We propose algorithms using tabu search and genetic algorithms to solve the SCTV problem and show computational results.

Keywords: just-in-time; sequence processing; variance; product rate variation; PRV; repetition value; correlation; sum of variance.

DOI: 10.1504/IJSOM.2022.121729

International Journal of Services and Operations Management, 2022 Vol.41 No.1/2, pp.102 - 113

Received: 24 Jan 2020
Accepted: 11 May 2020
Published online: 24 Mar 2022 *

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