JOB SHOP & FLOW SHOP SCHEDULING: DEVELOPMENT OF A HEURISTIC APPROACH

Abstract

In this work the jobshcp,Cscheduling problems have been-, reviewed in view of the existing methods, both exact and approxifaate, fur solging the scheduling problems. Two new approximate- m.thods (heuristics) have been proposed for solving the general flowshop scheduling problem. A computational study is made on the proposed methods by generating random sets of data. The eff`ctiveness of the proposed heuristics is demonstrated by comparing the solutions obtained from heuristics with the optimal solutions. \ Suggestions for further extension of the proposed heuristics...........