Multi-objective flow shop scheduling using hybrid simulated annealing

Measuring Business Excellence

Volumn 14, Issue 3, 2010, Pages 30-41

  Dhingra, Ashwani ^a   Chandna, Pankaj ^b  

^a MAHARSHI DAYANAND UNIVERSITY   (India)

^b NATIONAL INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Algorithmic languages; Flow production; Problem solving; Production scheduling; Programming and algorithm theory

Indexed keywords

EID: 77955899193     PISSN: 13683047     EISSN: None     Source Type: Journal    
DOI: 10.1108/13683041011074191     Document Type: Article

References (30)

1. Allahverdi, A. (2000), "Minimizing mean flow time in a two-machine flow shop with sequence-independent setup times" in Computers and Operation Research, Vol. 27, No. 2, pp. 111-27.
2. Allahverdi, A., Ng, C.T., Cheng, T.C.E. and Kovalyov, M.Y. (2008), "A survey of scheduling problems with setup times or costs" in European Journal of Operation Research, Vol. 187, No. 3, pp. 985-1032.
3. Choobineh, F.F., Mohebbi, E. and Khoo, H. (2006), "A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent set up times" in European Journal of Operational Research, Vol. 175, No. 1, pp. 318-37.
4. Danneberg, D., Tautenhahn, T. and Werner, F. (1999), "A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size" in Mathematical and Computer Modelling, Vol. 29, No. 9, pp. 101-26.
5. Eren, T. (2010), "A bicriteria m-machine flowshop scheduling with sequence-dependent setup times" in Applied Mathematical Modelling, Vol. 34, No. 2, pp. 284-93.
6. Erenay, F.S., Sabuncuoglu, I., Toptal, A. and Tiwari, M.K. (2010), "New solution methods for single machine bi-criteria scheduling problem: minimization of average flow time and number of tardy jobs" in European Journal of Operation Research, Vol. 201, No. 1, pp. 89-98.
7. Gupta, J.N.D., Venkata, G., Neppalli, R. and Werner, F. (2001), "Minimizing total flow time in a two-machine flow shop problem with minimum makespan" in International Journal of Production Economics, Vol. 69, No. 3, pp. 323-38.
8. Johnson, D.S., Aragon, C.R., McGeoeh, L.A. and Schevon, C. (1989), "Optimization by simulated annealing: an experimental evaluation; part I. Graph partitioning" in Operations Research, Vol. 37, No. 6, pp. 865-92.
9. Johnson, S.M. (1954), "Optimal two and three stage production schedules with setup times included" in Naval Research Logistics Quarterly, Vol. 1, No. 1, pp. 61-8.
10. Kim, Y.D. (1993), "Heuristics for flowshop scheduling problems minimizing mean tardiness" in Journal of Operational Research Society, Vol. 44, No. 1, pp. 19-28.
11. Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. (1983), "Optimization by simulated annealing" in Science, Vol. 220, No. 4598, pp. 671-80.
12. Loukil, T., Teghem, J. and Tuyttens, D. (2005), "Solving multi-objective production scheduling problems using metaheuristics" in European Journal Operation Research, Vol. 161, No. 1, pp. 42-61.
13. Marett, R. and Wright, M. (1996), "A comparison of neighborhood search techniques for multi-objective combinatorial problems" in Computers and Operations Research, Vol. 23, No. 5, pp. 465-83.
14. Murata, T., Ishibuchi, H. and Tanaka, H. (1996), "Genetic algorithms for flowshop scheduling problems" in Computers and Industrial Engineering, Vol. 30, No. 4, pp. 1061-71.
15. Naderi, B., Zandieh, M. and Roshanaei, V. (2009), "Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness" in International Journal of Advanced Manufacturing Technology, Vol. 41, Nos 11/12, pp. 1186-98.
16. Naderi, B., Zandieh, M., Balagh, K.K.G. and Roshanaei, V. (2009), "An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness" in Expert Systems with Applications: An International Journal, Vol. 36, No. 6, pp. 9625-33.
17. Nawaz, M., Enscore, E. and Ham, I. (1983), "A heuristic algorithm for the m-machine n-job flow shop sequencing problem" in Omega The International Journal of Management, Vol. 11, No. 1, pp. 91-5.
18. Noorul Haq, A. and Radha Ramanan, T. (2006), "A bicriterian flow shops scheduling using artificial neural network" in International Journal of Advanced Manufacturing Technology, Vol. 30, Nos 11/12, pp. 1132-8.
19. Parthasarathy, S. and Rajendran, C. (1997), "A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs - a case study" in Production Planning & Control, Vol. 8, No. 5, pp. 475-83.
20. Ponnambalam, S.G., Jagannathan, H., Kataria, M. and Gadicherla, A. (2004), "A TSP-GA multi-objective algorithm for flow shop scheduling" in International Journal of Advanced Manufacturing Technology, Vol. 23, Nos 11/12, pp. 909-15.
21. Rahimi-Vahed, R. and Mirghorbani, S.M. (2007), "A multi-objective particle swarm for a flow shop scheduling problem" in Journal of Combinatorial Optimization, Vol. 13, No. 1, pp. 79-102.
22. Rajendran, C. (1995), "Theory and methodology heuristics for scheduling in flow shop with multiple objectives" in European Journal of Operation Research, Vol. 82, No. 3, pp. 540-55.
23. Ravindran, D., Noorul Haq, A., Selvakuar, S.J. and Sivaraman, R. (2005), "Flow shop scheduling with multiple objective of minimizing makespan and total flow time" in International Journal of Advanced Manufacturing Technology, Vol. 25, pp. 1007-12.
24. Shang, J.S. (1993), "Theory and methodology: multicriteria facility layout problem: an integrated approach" in European Journal of Operational Research, Vol. 66, No. 3, pp. 291-304.
25. Suresh, G. and Sahu, S. (1993), "Multi-objective facility layout using simulated annealing" in International Journal of Production Economics, Vol. 32, No. 2, pp. 239-54.
26. Taillard, E. (1993), "Benchmarks of basic scheduling problems" in European Journal of Operation Research, Vol. 64, No. 2, pp. 278-85.
27. Toktas, B., Azizoglu, M. and Koksalan, S.K. (2004), "Two-machine flow shop scheduling with two criteria: maximum earliness and makespan" in European Journal of Operation Research, Vol. 157, No. 2, pp. 286-95.
28. Van Laarhoven, P.J.M., Aarts, E.H.L. and Lenstra, J.K. (1992), "Job shop scheduling by simulated annealing" in Operations Research, Vol. 40, No. 1, pp. 113-25.
29. Corwin, B.D. and Esogbue, A.O. (1974), "Two machine flow shop scheduling problems with sequence dependent setup times: a dynamic programming approach" in Naval Research Logistic Quarterly, Vol. 21, No. 3, pp. 515-23.
30. Ruiz, R. and Stutzle, T. (2008), "An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives" in European Journal of Operational Research, Vol. 187, No. 3, pp. 1143-59.