A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs
An experimental investigation of the performance of dispatching rules and a heuristic for scheduling in static flowshops with missing operations is undertaken in this study. The measure of performance is the minimization of total flow time of jobs. Permutation schedules are generated by using the heuristic for scheduling. General schedules, which can be permutation or non-permutation schedules, are obtained by using dispatching rules. Four dispatching rules, including a new dispatching rule, are considered. Two types of flowshops are studied: one with no missing operations of jobs and another with missing operations of jobs. In the latter type of flowshops, jobs with varying number of missing operations are considered. An extensive investigation of the performance of the dispatching rules and the heuristic is carried out. It is observed that the heuristic minimizes total flow time of jobs more than dispatching rules up to a certain level of missing operations of jobs in flowshops, after which dispatching rules perform better. The performance of the heuristic and the dispatching rules in terms of minimizing the makespan as a secondary measure is also reported.
heuristics flowshop scheduling