Completion time variance and the product rate variation problem
by Amrutha Renganathan; G. Srinivasan
International Journal of Services and Operations Management (IJSOM), Vol. 41, No. 1/2, 2022

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.

Online publication date: Thu, 24-Mar-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services and Operations Management (IJSOM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com