Multi-objective no-wait flowshop scheduling problems: Models and algorithms

International Journal of Production Research

Volumn 50, Issue 10, 2012, Pages 2592-2608

  Naderi, B ^a   Aminnayeri, M ^b   Piri, M ^c   Ha'iri Yazdi M H ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^c IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Mixed integer linear programming model; Multi objective iterated local search algorithm; No wait flowshop scheduling

Indexed keywords

EID: 85011696794     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2010.543937     Document Type: Article

References (50)

1. Aldowaisan, T. and Allahverdi, A., 2004. New heuristics for m-machine no-wait flowshop to minimize total completion time. Omega, 32 (5), 345-352.
2. Bonney, M.C. and Gundry, S.W., 1976. Solutions to constrained flowshop sequencing problem. Operational Research Quarterly, 27, 869-883.
3. Carlsson, C. and Fuller, R., 1996. Fuzzy multiple criteria decision making: recent developments. Fuzzy Sets and Systems, 78, 139-153.
4. Chen, C. and Neppalli, R., 1996. Genetic algorithms applied to the continuous flow shop problem. Computers and Industrial Engineering, 30 (4), 919-929.
5. Chen, Y., Li, X., and Sawhney, R., 2009. Restricted job completion time variance minimization on identical parallel machines. European Journal of Industrial Engineering, 3 (3), 261-276.
6. Dong, X., Huang, H., and Chen, P., 2009. An iterated local search algorithm for the permutation flowshop problem with total flow time criterion. Computers and Operations Research, 36 (5), 1664-1669.
7. Fink, A. and Vo B. S., 2003. Solving the continuous flow-shop scheduling problem by metaheuristics. European Journal of Operational Research, 151, 400-414.
8. Gangadharan, R. and Rajendran, C., 1993. Heuristic algorithms for scheduling in the no-wait flowshop. International Journal of Production Economics, 32, 285-290.
9. Geiger, M.J., 2007. On operators and search space topology in multi-objective flowshop scheduling. European Journal of Operational Research, 181 (1), 195-206.
10. Goyal, S.K. and Sriskandarajah, C., 1998. No-wait shop scheduling: computational complexity and approximate algorithms. Operations Research, 25, 220-244.
11. Grabowski, J. and Pempera, J., 2000. Sequencing of jobs in some production system. European Journal of Operational Research, 125, 535-550.
12. Grabowski, J. and Pempera, J., 2005. Some local search algorithms for no-wait flow-shop problem with makespan criterion. Computers and Operations Research, 32, 2197-2212.
13. Graham, R.L., et al., 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287-326.
14. Gupta, J.N.D., 1976. Optimal flowshop schedules with no intermediate storage space. Naval Research Logistics, 23, 235-243.
15. Hall, N.C. and Sriskandarajah, C.A., 1996. Survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44, 510-525.
16. Hmida, A.B., et al., 2007. Climbing depth-bounded discrepancy search for solving hybrid flow shop problems. European Journal of Industrial Engineering, 1 (2), 223-240.
17. King, J.R. and Spachis, A.S., 1980. Heuristics for flowshop scheduling. International Journal of Production Research, 18, 345-357.
18. Knowles, J., Thiele, L., and Zitzler, E., 2006. A tutorial on the performance assessment of stochastic multiobjective optimizers. Technical Report 214, Computer Engineering and Networks Laboratory (TIK), ETH Zurich (Revised version).
19. Li, X., Wang, Q., and Wu, C., 2008. Heuristic for no-wait flow shops with makespan minimization. International Journal of Production Research, 46 (9), 2519-2530.
20. Li, X., et al., 2007. Influencing factors of job waiting time variance on a single machine. European Journal of Industrial Engineering, 1 (1), 56-73.
21. Liesegan, G. and Ruger, M., 1972. Flowshop sequencing problem with no wait in process. Operational Research Quarterly, 23, 591-598.
22. Lourenco, H.R., Martin, O.C., and Stutzle, T., 2003. Iterated local search. In: F. Glover and G.A. Kochenberger, eds. Handbook of metaheuristics. Boston, MA: Kluwer Academic, 321-353.
23. Manne, A.S., 1960. On the job-shop scheduling problem. Operations Research, 8 (2), 219-223.
24. Matta, M.E., 2009. A genetic algorithm for the proportionate multiprocessor open shop. Computers and Operations Research, 36, 2601-2618.
25. Minella, G., Ruiz, R., and Ciavotta, M., 2008. A review and evaluation of multi-objective algorithms for the flowshop scheduling problem. INFORMS Journal on Computing, 20 (3), 451-471.
26. Montgomery, D.C., 2000. Design and analysis of experiments. 5th ed. New York, NY: John Wiley and Sons.
27. Naderi, B. and Ruiz, R., 2010. The distributed permutation flowshop scheduling problem. Computers and Operations Research, 37, 754-768.
28. Naderi, B., Ruiz, R., and Zandieh, M., 2010. Algorithms for a realistic variant of flowshop scheduling. Computers and Operations Research, 37, 236-246.
29. Nawaz, M, Enscore Jr, E.E., and Ham, I., 1983. A heuristic algorithm for the m machine, n job flowshop sequencing problem. Omega - International Journal of Management Science, 11, 91-95.
30. Pan, C.H., 2007. A study of integer programming formulations for scheduling problems. International Journal of Systems Sciences, 28 (1), 33-41.
31. Pan, Q.K. and Wang, L., 2008. A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems. European Journal of Industrial Engineering, 2 (3), 279-297.
32. Pan, Q.K., Tasgetiren, M.F., and Liang, Y.C., 2008a. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers and Operations Research, 35, 2807-2839.
33. Pan, Q.K., Wang, L., and Zhao, B.H., 2008b. An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion. International Journal of Advanced Manufacturing Technology, 38, 778-786.
34. Pinedo, M.L., 2008. Scheduling: theory, algorithms, and systems. 3rd ed. New York, NY: Springer Science+Business Media.
35. Raaymakers, W.H.M. and Hoogeveen, J.A., 2000. Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research, 126, 131-151.
36. Rahimi-Vahed, A.R. and Mirghorbani, S.M., 2007. A multi-objective particle swarm for a flowshop scheduling problem. Journal of Combinatorial Optimization, 13, 79-102.
37. Rajendran, C. and Chaudhuri, D., 1990. Heuristic algorithms for continuous flowshop problem. Naval Research Logistics, 37, 695-705.
38. Rock, H., 1984. Some new results in flow shop scheduling. Mathematical Methods of Operations Research, 28, 1-16.
39. Ruiz, R. and Stutzle, T., 2007. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177 (3), 2033-2049.
40. Schuster, C.J. and Framinan, J.M., 2003. Approximate procedure for no-wait job shop scheduling. Operations Research Letters, 31, 308-318.
41. Shyu, S.J., Lin, B.M.T., and Yin, P.Y., 2004. Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time. Computers and Industrial Engineering, 47, 181-193.
42. Taillard, E., 1993. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64 (2), 278-285.
43. Tavakkoli-Moghaddam, R., Vahed, A.R., and Hossein Mirzaei, A., 2007. A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Information Sciences, 177, 5072-5090.
44. Valente, J.M.S. and Schaller, J.E., 2010. Improved heuristics for the single machine scheduling problem with linear early and quadratic tardy penalties. European Journal of Industrial Engineering, 4 (1), 99-129.
45. Varadharajan, T.K. and Rajendran, C., 2005. A multi-objective simulated-annealing algorithm to minimize the makespan and total flow time of jobs. European Journal of Operational Research, 167, 772-795.
46. Wagner, H.M., 1959. An integer linear-programming model for machine scheduling. Naval Research Logistics Quarterly, 6 (2), 131-140.
47. Wismer, D.A., 1972. Solution of flowshop-scheduling problem with no intermediate queues. Operations Research, 20, 689-697.
48. Zimmermann, H.J., 1978. Fuzzy programming and linear programming with several objective functions. Fuzzy Sets and Systems, 1, 45-55.
49. Zitzler, E. and Thiele, L., 1999. Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Transactions Evolutionary Computation, 3, 257-271.
50. Zitzler, E., et al., 2003. Performance assessment of multi-objective optimizers: an analysis and review. IEEE Transactions Evolutionary Computation, 7, 117-132.