A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness

International Journal of Production Research

Volumn 47, Issue 1, 2009, Pages 273-288

  Braglia, Marcello ^a   Grassi, Andrea ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

Flowshop scheduling; Heuristic; Makespan; Maximum tardiness; NEH; TOPSIS

Indexed keywords

HEURISTIC ALGORITHMS; HEURISTIC METHODS; LEARNING SYSTEMS; SCHEDULING; SOLUTIONS;

FLOWSHOP SCHEDULING; HEURISTIC; MAKESPAN; MAXIMUM TARDINESS; NEH; TOPSIS;

PROBLEM SOLVING;

EID: 56349119327     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701500486     Document Type: Article

References (28)

1. Allahverdi, A., A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. Comput. Oper. Res., 2004, 31, 157-180.
2. Bagchi, T.P., Multiobjective Scheduling by Genetic Algorithms, 1999 (Kluwer: Dordrecht).
3. Baker, K.R., Introduction to Sequencing and Scheduling, 1974 (Wiley: New York).
4. Campbell, H.G., Dudek, R.A. and Smith, M.L., A heuristic algorithm for the n-job, M-machine sequencing problem. Manage. Sci., 1970, 16/B, 630-637.
5. Cavalieri, S. and Gaiardelli, P., Hybrid genetic algorithms for a multiple-objective scheduling problem. J. Intell. Manufact., 1998, 9, 361-367.
6. Chakravarthy, K. and Rajendran, C., A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization. Prod. Plan. Cont., 1999, 10, 707-714.
7. Dannenbring, D.G., An evaluation of flow-shop sequencing heuristics. Manage. Sci., 1977, 23, 1174-1182.
8. Evans, G., An overview of techniques for solving multiobjective mathematical programs. Manage. Sci., 1984, 30, 1268-1282.
9. Gupta, J.N.D., A functional heuristic algorithm for the flow-shop scheduling problem. Oper. Res. Quart., 1971, 22, 39-47.
10. Gupta, J.N.D., Henning, K. and Werner, F., Local search heuristics for two-stage flow shop problems with secondary criterion. Comput. Oper. Res., 2002, 29, 123-149.
11. Gupta, J.N.D., Palanimuthu, N. and Chen, C.-L., Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion. Prod. Plan. Contr., 1999, 10, 251-265.
12. Ho, J.C. and Chang, Y.-L., A new heuristic for the n-job, M-machine flow-shop problem. Eur. J. Oper. Res., 1991, 52, 194-202.
13. Hwang, C.L. and Yoon, K., Multiple Attribute Decision Making: Methods and Applications, 1981 (Springer: New York).
14. Ishibuchi, H. and Murata, T., A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans. Syst., Man, Cybernet., 1998, 28, 392-403.
15. Ishibuchi, H., Yoshida, T. and Murata, T., Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Trans. Evolution. Comput., 2003, 7, 204-223.
16. Lee, Y.H., Lee, B.K. and Jeong, B., Multi-objective production scheduling of probe process in semiconductor manufacturing. Prod. Plan. Contr., 2000, 11, 660-669.
17. Murata, T., Ishibuchi, H. and Tanaka, H., Multi-objective genetic algorithm and its applications to flowshop scheduling. Comput. Indust. Eng., 1996, 30, 957-968.
18. Nawaz, M., Enscore Jr, E.E. and Ham, I., A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA, 1983, 11, 91-95.
19. Palmer, D.S., Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. Oper. Res. Quart., 1965, 16, 101-107.
20. Rajendran, C., A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. Int. J. Prod. Res., 1994, 32, 2541-2558.
21. Rajendran, C., Heuristics for scheduling in flowshop with multiple objectives. Eur. J. Oper. Res., 1995, 82, 540-555.
22. Rinnooy Kan, A.H.G., Machine Scheduling Problems, 1967 (Martinus Nijhoff: The Hague).
23. Schaffer, J.D., Multiple objective optimization with vector evaluated genetic algorithms, in Proceedings of the 1st International Conference on Genetic Algorithms (ICGA), 1985, pp. 93-100.
24. T'Kindt, V. and Billaut, J.-C., Multicriteria scheduling problems: a survey. RAIRO Oper. Res., 2001, 35, 143-163.
25. Tagami, T. and Kawabe, T., Genetic algorithm with a Pareto partitioning method for multiobjective flowshop scheduling, in Proceedings of the 1998 International Symposium of Nonlinear Theory and its Applications (NOLTA), 1998, pp. 1069-1072.
26. Triantaphyllou, E. and Lin, C.-T., Development and evaluation of five fuzzy multiattribute decision-making methods. Int. J. Approx. Reason, 1996, 14, 281-310.
27. Varadharajan, T.K. and Rajendran, C., A multi-objective simulated annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. Euro. J. Oper. Res., 2005, 167, 772-795.
28. Zhao, Y., Brizuela, C.A. and Sannomiya, N., Application of the partial enumeration selection method in genetic algorithms to solve a multi-objective flowshop problem. Proceedings of the 2001 IEEE Int. Conference on Syst. Man, Cybern., 2001, 4, 2365-2370.