Please use this identifier to cite or link to this item:
|Title:||JOB SHOP & FLOW SHOP SCHEDULING: DEVELOPMENT OF A HEURISTIC APPROACH|
|Keywords:||MECHANICAL & INDUSTRIAL ENGINEERING;JOB SHOP SCHEDULING;FLOW SHOP SCHEDULING;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...........|
|Research Supervisor/ Guide:||Gaindhar, J. L.|
|Appears in Collections:||MASTERS' THESES (MIED)|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.