HEURISTIC APPROACH | ||||||
Sr. | Year | Researcher Name | Approach | Objectives | Results | Validation approach |
1 | 1983 | K. E. Stecke & F. Brian Talbot [2] | Heuristic methods | Ø Minimizing part movements Ø Balancing of workload Ø Unbalancing of workload | Determined how machine tool magazine in a FMS can be loaded to meet simultaneous requirements of a number of different parts | Computational results are presented |
2 | 1985 | K. Shankar & Y. J. Tzen [14] | Heuristic methods | Ø Minimizing system unbalance Ø Number of late jobs Ø Balancing of workload | Computational results presented gives improved results | performance is compared with previous results from literature |
3 | 1988 | J. A. Ventura, F. F. Chen, & M. S. Leonard [15] | Heuristic algorithms | Ø Minimizing make span | Improved Performance | The performance of each of the proposed algorithms is evaluated by testing on two hypothetical FMSs. |
4 | 1990 | B. Ram, S. Sarin, & C. S. Chen [16] | Fast heuristic algorithms | Ø Maximizing throughput | FMS loading problem can be solved near optimally in short time | Computational results are produced and compared with previous results |
5 | 1992 | S. K. Mukhopadhyay, S. Midha, & V. Murlikrishna [17] | Heuristic procedure | Ø Minimizing system unbalance Ø Maximizing throughput | Results show that algo developed is very reliable and efficient | tested on ten problems and are compared with existing results |
6 | 1993 | K. Kato, F. Oba, & F. Hashimoto [18] | Heuristic approach | Ø Minimizing total number of cutting tools required Ø Maximizing utilization rate of each machine | Computational results shows improved effectiveness | Computational results are given to demonstrate the effectiveness of the proposed method |
7 | 1995 | E. K. Steeke & F. Brian Talbot [19] | Heuristic Algorithms | Ø Minimizing part movements Ø balancing of workload Ø unbalancing of workload | Results are computationally demonstrated & found improved significantly | Computational results are produced and compared with previous results |
8 | 1997 | M. K. Tiwari et al. [20] | Heuristic solution approach | Ø Maximizing throughput Ø Minimizing system unbalance | Graphical representation and subsequent model validation | Computational results are produced and compared with previous results |
9 | 1998 | G. K. Nayak & D. Acharya [21] | Heuristics and mathematical programming approaches | Ø Maximizing part types in each batch Ø Maximizing routing flexibility of batches | Heuristic proposed for part type selection & simple mathematical programs for other two problems | Computational results are compared with existing results |
10 | 2000 | D.-H. Lee & Y.-D. Kim [22] | Heuristic algorithms | Ø Minimizing maximum workload of machines | Results show that suggested algos perform better than existing | Simulation results are compared with existing results |
11 | 2006 | N. Nagarjunaa, O. Maheshb, & K. Rajagopal [23] | Heuristic based on multi stage programming approach | Ø Minimizing system unbalance | Bring together productivity of flow lines and flexibility of job shops | Tested on 10 sample problems available in FMS literature and compared with existing solution methods |
12 | 2006 | M. Goswami & M. K. Tiwari [24] | Heuristic-based approach | Ø Minimizing system unbalance Ø Maximizing throughput | Loading problem is crucial link between tactical planning and operational decisions | Extensive computational experiments have been carried out to assess the performance of the proposed heuristic and validate its relevance |
13 | 2007 | M. K. Tiwari, J. Saha, & S. K. Mukhopadhyay [25] | Heuristic Solution Approaches | Ø Minimizing system unbalance Ø Maximizing throughput | GA based heuristic are found more efficient and outperform in terms of solution quality | tested on problems representing three different FMS scenarios from available literature |