| GLOBAL OPTIMIZATION ALGORITHMS | ||||||
| a. Deterministic approach | ||||||
| 1. Branch and bound | ||||||
| Sr. | Year | Researcher Name | Approach | Objectives | Results | Validation approach |
| 1 | 1986 | M. Berrada & K. E. Stecke [26] | Branch and bound approach | Ø Balancing of workload | Computational results gives fruitful results | Computational results are produced and demonstrated the efficiency of suggested procedures |
| 2 | 1989 | K. Shankar & A. Srinivasulu [27] | Branch & backtrack procedure and Heuristic procedures | Ø Maximizing assigned workload Ø Maximizing throughput Ø Minimizing workload unbalance | Each procedure is illustrative by numerical example and results are with improved performance | An illustrative numerical example |
| 3 | 1994 | Y. D. Kim & C. A. Yano [28] | New branch and bond algorithm | Ø Maximizing throughput | Improved efficiency | Computational results are produced and compared with previous results |
| 2. Algebraic Geometry | ||||||
| 4 | 1986 | T. J. Greene & R. P. Sadowski [29] | Mixed integer programming | Ø Minimizing make span Ø Minimizing mean flow time Ø Minimizing mean lateness | Explained simple numeric example | a simple numeric example |
| 5 | 1987 | S.C. Sarin & C.S. Chen [30] | Mathematical model | Ø Minimizing overall machining cost | Computational results are reported | Computational results are compared with literature results |
| 6 | 1990 | K. M. Bretthauer & M. A. Venkataramanan [31] | Linear Integer Programming | Ø Maximizing weighted sum of number of operation to machine assignments | Computational results are satisfactory with improved performance | Computational results are produced |
| 7 | 1990 | H. C. Co, J. S. Biermann, & S.K. Chen [32] | Mixed-integer programming (MIP) | Ø Balancing of workloads | Results were found practical | Computational results are produced |
| 8 | 1990 | M. Liang & S. P. Dutt [33] | Mixed-Integer Programming | Ø Minimizing production cost | Demand for change on optimal solution | An example problem is solved |
| 9 | 1993 | Ming Liang [34] | Non-linear programming | Ø Maximizing system output | production cost can be significantly reduced using this approach | Computational results with an illustrative example is demonstrated |
| 10 | 1994 | Ming Liang [35] | Non-linear programming | Ø Maximizing system output Ø minimizing production cost | Production cost can be significantly reduced using this approach | An illustrative example is solved using the suggested approach |
| 11 | 1997 | V. N. Hsu & R. D. Matta [36] | Lagrangian-based heuristic procedure (MIP problem formulation) | Ø total processing cost | finds a good loading solution | iteratively compared different scenarios |
| 12 | 1998 | T. J. Sawik [37] | Integer programming & approximative lexicographic approach | Ø Balancing workloads Ø Minimizing total interstation transfer time | Results of computational experiments are reported | illustrative example and some results of computational experiments |
| 13 | 1999 | F. Guerrero, S. Lozano, T. Koltai, & J. Larranaeta [38] | Mixed-integer linear program | Ø Balancing of workload | New approach to loading problem | Computational results are produced |
| 14 | 2001 | N. Kumar & K. Shanker [39] | Mixed integer programming | Ø Balancing of Workload | Results are in agreement with previous findings | Computational results are compared with the previous findings |