Heuristics for the PRV problem
Date22nd Apr 2021
Time03:00 PM
Venue Webex
PAST EVENT
Details
> Balancing of the line and sequencing of the products for production, are the important issues to be addressed, in a mixed model assembly line, since they can have significant economic impacts on the firm. In this research work, the focus is on the sequencing part of the mixed-model assembly production system. The sequencing problem is an operational problem and hence the computational time is very important for any solution technique used to solve the problem.
>
> Production Rate Variation (PRV) has been used as an objective in the literature for the mixed model sequencing problem and the resulting problem is called the PRV problem. In this work, lower bound is calculated; rule based heuristics and Tabu search algorithm have been developed for the PRV problem. The above heuristics and tabu search were applied to the standard problems in the literature.
>
> Also, total cost is considered as an additional objective, to the PRV, for the sequencing problem. The resultant bi-criteria decision making problem was solved using the Tabu search. The same was applied to the problems in the literature and non-dominated solutions have been obtained for many of those problems.
>
> Further, the possibility of applying the PRV problem in a different domain of sports scheduling was explored. It was found to be possible by modelling the Indian Premier League (IPL) scheduling as a PRV problem. Also, an additional objective of total distance travelled by all the teams was considered. The resulting bi-criteria decision making problem was solved by the Tabu Search and non-dominated solutions were obtained.
Speakers
Mr. Pradyumna (MS17S001)
Department Of Management Studies