Jayakumar Sundaramoorthy

Meganathan Rangaraji

Abstract

In this paper we are considering the open shop scheduling problem with the objective of minimizing makespan with release dates, when preemption is not allowed. A dynamic longest processing time-Dense schedule (DLPT-DS) for the problem o/r/c is presented and comparison is made with Dynamic shortest processing time-Dense schedule (DSPT-DS) in three cases namely, number of jobs less than number of machines, mumber of jobs greater than number of machines and number of jobs equal to number of machines. In all the three cases, the experimental result shows that the DLPT-DS is more consistent with respect to minimizing makespan criteria when compared with DSPT-DS.

Keywords- Heuristic, Open Shop Scheduling Problem, Makespan.