1 |
Varadharajan, T. K. and Rajendran, C. (2005), A multiobjective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs, European Journal of Operational Research, 167, 772-795.
DOI
ScienceOn
|
2 |
Taillard, E. (1993), Benchmark for basic scheduling problems, European Journal of Operational Research, 64, 278-285.
DOI
ScienceOn
|
3 |
Ishibuchi, H. and Murata, T. (1998), A Multi-objective Genetic Local Search Algorithm and Its Application to Flowshop Scheduling, IEEE Transactions on Systems, Man and Cybernetics-Part C: Applications and Reviews, 28, 392-403.
DOI
ScienceOn
|
4 |
Ulungu, E. L., Teghem, J., Fortemps, P. H., and Tuyttens, D. (1999), MOSA Method: A tool for solving multiobjective combinatorial optimization problems, Journal of Multicriteria Decision Analysis, 8, 221-236.
DOI
ScienceOn
|
5 |
Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P. (1983), Optimization by simulated annealing, Science, 220, 671-680.
DOI
|
6 |
Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E. (1953), Equation of State Calculation by Fast Computing Machines, Journal of Chemical Physics, 21, 1087-1092.
DOI
|