Flowshop scheduling problem to minimize total completion time with random and bounded processing times

Flowshop scheduling problem to minimize total completion time with random and bounded processing times

0.00 Avg rating0 Votes
Article ID: iaor20051319
Country: United Kingdom
Volume: 55
Issue: 3
Start Page Number: 277
End Page Number: 286
Publication Date: Mar 2004
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: production
Abstract:

The flowshop scheduling problems with n jobs processed on two or three machines, and with two jobs processed on k machines are addressed where jobs have random and bounded processing times. The probability distributions of random processing times are unknown, and only the lower and upper bounds of processing times are given before scheduling. In such cases, there may not exist a unique schedule that remains optimal for all feasible realizations of the processing times, and therefore, a set of schedules has to be considered which dominates all other schedules for the given criterion. We obtain sufficient conditions when transposition of two job minimizes total completion time for the cases of two and three machines. The geometrical approach is utilized for flowshop problem with two jobs and k machines.

Reviews

Required fields are marked *. Your email address will not be published.