Pareto archived simulated annealing for permutation flow shop scheduling with multiple objectives

2004 IEEE Conference on Cybernetics and Intelligent Systems

Volumn , Issue , 2004, Pages 711-716

  Suresh, R K ^a   Mohanasundaram, K M ^b  

^a AMRITA UNIVERSITY   (India)

^b PSG COLLEGE OF TECHNOLOGY   (India)

Author keywords

Flow shop scheduling; Multi objective scheduling; Simulated annealing

Indexed keywords

DECISION MAKING; GENETIC ALGORITHMS; OPTIMIZATION; PARAMETER ESTIMATION; PARETO PRINCIPLE; PERTURBATION TECHNIQUES; SCHEDULING;

FLOW SHOP SCHEDULING; MULTI-OBJECTIVE SCHEDULING; REDUCTION FACTOR; SEGMENT-RANDOM INSERTION (SRI);

SIMULATED ANNEALING;

EID: 11244350754     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Taillard, E. "Benchmarks for basic scheduling problems", European Journal of Operational Research, 64, 278-285, 1993.
2. Nawaz, M., Jr. E.E. Enscore and I. Ham, "A heuristic algorithm for the m-machine, n-job flow shop sequencing problem, OMEGA, 11, 91-95, 1995.
3. MacCarthy, B.L. and J. Liu, "Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling", Int. J. of Production Research, 31, 59-79, 1993.
4. Ho, J.C. and Y.-L. Chang, "A new heuristic for the n-jobs, m-machine flow shop problem", European Journal of Operational Research, 52, 194-202, 1991.
5. Widmer and A.Hertz, "An new heuristic method for the flow shop sequencing problem", European Journal of Operational Research, 41, 186-193, 1989.
6. i scheduling problem", European Journal of Operational Research, 132, 439-452, 2001.
7. Rajendran, C and D. Chaudhuri, "An eficient heuristic approach to the scheduling of jobs in a flow shop", European Journal of Operational Research, 61, 318-325, 1992.
8. Rajendran, C and H. Zeigler, "Ant-colony algorithms for permutation flow shop scheduling to minimize makespan/total flow time of jobs", European Journal of Operational Research, 2003, (In press).
9. T'kindt, V. and J. - C. Billaut, "Multicriteria scheduling problems: A survey", RAIRO Operations Research, 35, 143-163, 2001.
10. Rajendran, C, "Heuristics for scheduling in flow shop with multiple objectives", European Journal of Operational Research, 82, 540-555, 1995.
11. Sridhar, J. and C. Rajendran, "Scheduling in flow shop and cellular manufacturing systems with multiple objectives - A genetic algorithmic approach", Production Planning and Control, 7(4), 374-382, 1996.
12. Schaffer, J.D, "Multiobjecive optimization with vector evaluated genetic algorithms", Proc. of the first ICGA, 93-100, July 1985.
13. Srinivas, N., and K. Deb. "Multiobjective function optimisation using nondominated sorting genetic algorithms", IEEE Journal on Evolutionary Computation, 2(3), 221-248, 1995.
14. Fonseca, C.M., and P.J. Fleming, "Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization", Proceedings of the Fifth International Conference on Genetic Algorithms, 416-423, July 1993.
15. Chang, P. C., J.C. Hsieh and S.G. Lin, "The development of gradual priority weighting approach for the multi-objective flow shop scheduling problem", International Journal on Production Economics, 79, 171-183, 2002.
16. Deb, K., Amrit Pratap, Sameer Agarwal, and T. Meyarivan. "Fast and elitist multiobjective genetic algorithm: NSGA II ", IEEE Journal on Evolutionary Computation, 6(2), 182-197, 2002.
17. Bagchi, T.P, "Multiobjective scheduling by genetic algorithms", Kluwer Academic Publishers, Boston, Massachusetts, 1999.
18. Ishibuchi H., and T. Murata, "A multi-objective genetic local search algorithm and its application to flow shop scheduling", IEEE Tansactions on Systems, Man and Cybernetics-Part C: Appliationa nd Reviews, 28, 392-403, 1998.
19. Ishibuchi, H., T. Yoshida, and T. Murata. "Balance between genetic search and local search in mementic algorithms for multiobjective permutation flowshop scheduling", IEEE transactions on Evolutionary Compulation, 7(2), 204-223, 2003.
20. Yong, Z., and N. Sannomiya, "Application of the partial enumeration selection method in genetic algorithms to solving a multi-objective flow shop problem", Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 2001.
21. Varadharajan., T.K., "A multi-objective simulated annealing algorithm for scheduling in flow shops to minimize makespan and total flow time of jobs", Unpublished M.S. Thesis, Industrial Engineering and Management Division, Indian Institute of Technology-Madras, 2003.
22. Garey, M. R., D.S. Johnson and R. Sethi, "The complexity of flow shop and job shop scheduling", Mathematics of Operations Research", 1, 117-129, 1976.
23. Chen, P., and R. Bulfin. "Complexity of multiple machine multicriteria scheduling problems", Proceedings of the third IERC, Atlanta, 1994.
24. Kirkpatrick, S., C.D. Gelatt Jr, and M.P. Vecchi. "Optimization by simulated annealing", Science, 220(4598), 671 - 680, 1983.
25. Aarts, E.H.L., and J.K. Lenstra, (eds). "Local search and combinatorial optimization", Wiley, NY, 1997.