| OTHER OPTIMIZATION TECHNIQUES | ||||||
| 1 | 1984 | K. E. Stecke & T. L. Morin [67] | Single server closed queueing network model | Ø Balancing of workload | Maximizes expected production of FMS | Results are compared and contrasted with previous models of production systems |
| 2 | 1986 | K. E. Stecke [68] | Hierarchical approach | Ø Maximizing throughput | Nonlinear integer programs models | Ties with some previous results & use of the proposed models to solve realistic loading problems is discussed |
| 3 | 1986 | J. G. Shanthikumar & K. E. Stecke [69] | Dynamic approach | Ø Balancing of workload | Result maximizes expected production | results obtained here complement previous results from literature |
| 4 | 1993 | Y.-D. Kim [70] | Due-Date Based Loading methods | Ø Maximizing throughput | Results reported reduced tardiness and makespan & in-creased throughput | Computational tests |
| 5 | 1997 | H.-K. Roh & Y-D. Kim [71] | Due-Date Based Loading methods | Ø Minimizing total tardiness | Iterative approach performs better than others | Computational tests on randomly generated problems |
| 6 | 1997 | D. H. Lee, S. K. Lim, G. C. Lee, H. B. Jun, & Y. D. Kim [72] | Iterative algorithms | Ø Minimizing subcontracting costs | Solved part selection and loading problems | computational experiments on randomly generated test problems |
| 7 | 1997 | Y. D. Kim and C. A. Yano [73] | Queueing network model | Ø Maximizing throughput Ø Maximizing make span Ø Balancing of workload | Reducing number of machine groups and balancing workloads among machines help to reduce make span | Computational results are produced |
| 8 | 1998 | D.-H. Lee & Y.-D. Kim [74] | Iterative procedures | Ø Minimizing earliness Ø Minimizing tardiness Ø Minimizing subcontracting costs | Computational experiments on randomly generated test problems are produced | computational experiments are done on randomly generated test problems and the results are compared with existing results |
| 9 | 1999 | J. N. D. Gupta, L. H. S. Luong, & V. H. Nguyen [75] | Dispatching approach | Ø Minimizing make spans Ø Minimizing average flow time Ø Minimizing tardiness | Satisfactory performance of given dispatching algorithm | Simulation results are compared with existing results |
| 10 | 2000 | S. Rahimifard & S.T. Newman [76] | Combined machine loading (CML) algorithms | Ø Meeting delivery dates Ø Minimising production costs | Adoption of algorithms within an application is dependent on number of manufacturing constraints | Computational results are produced and performance measure is carried out in virtual environment |
| 11 | 2012 | W. F. Mahmudy, R. M. Marian, & L. H. S. Luong [77] | Real coded genetic algorithms (RCGA) | Ø Maximizing throughput Ø Minimizing system unbalance | RCGA improves FMS performance & minimizes required computational time | Results are compared to the previous literature work |