Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions

International Journal of Production Research

Volumn 44, Issue 5, 2006, Pages 939-957

  Franca P M ^a   Tin Jr , G ^a   Buriol, L S ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Flowshop problem; Genetic algorithms; Heuristics; Machine scheduling; Memetic algorithms; No wait flowshop

Indexed keywords

HEURISTIC METHODS; MACHINE COMPONENTS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

FLOWSHOP PROBLEM; MACHINE SCHEDULING; MEMETIC ALGORITHMS; NO-WAIT FLOWSHOP;

GENETIC ALGORITHMS;

EID: 32644462404     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540500282914     Document Type: Article

References (23)

1. Andersen, E.J., Glass, C. and Potts, C.N., Machine scheduling. In Local Search in Combinatorial Optimisation, edited by E. Aarts and J.K. Lenstra, pp. 361-414, 1997 (Wiley: Chichester).
2. Aldowaisan, T., A new heuristic and dominance relations for no-wait flowshops with setups. Computers & Op. Res., 2001, 28(6), 563-584.
3. Aldowaisan, T. and Allahverdi, A., Three-machine no-wait flowshop with separated setup and removal times to minimise total completion time. Int. J. Indust. Eng. - Theory Applications and Practice, 2004, 11(2), 113-123.
4. Allahverdi, A. and Aldowaisan, T., Minimising total completion time in a no-wait flowshop with sequence-dependent additive changeover times. J. Op. Res Soc:, 2001, 52(4), 449-462.
5. Allahverdi, A., Gupta, J.N.D. and Aldowaisan, T., A review of scheduling research involving setup considerations. Omega, 1999, 27(2), 219-239.
6. Bianco, L., Dell'Olmo, P. and Giordani, S., Flow shop no-wait scheduling with sequence dependent setup times and release dates. INFOR, 1998, 37(1), 3-19.
7. Blazewicz, J., Ecker, K., Schmidt, G. and Weglarz, J., 1993, Scheduling in Computer and Manufacturing Systems (Springer: Berlin/Heidelberg).
8. Boese, K., Cost versus distance in the traveling salesman problem. Technical Report, TR-950018, UCLA, CS Department, 1995, 66.
9. Brown, S.I., McGarvey, R. and Ventura, J.A., Total flowtime and makespan for a no-wait m-machine flowshop with setup times separated. J. Op. Res. Soc., 2004, 55(6), 614-621.
10. Brucker, P., Scheduling Algorithms, 1995 (Springer: New York).
11. Buriol, L.S., Franca, P.M. and Moscato, P., A new memetic algorithm for the asymmetric traveling salesman problem. J. Heuristics, 2004, 10(5), 485-508.
12. Dawkins, R., The Selfish Gene, 1976 (Oxford University Press: Oxford).
13. Freisleben, B. and Merz, P., A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems, in Proceedings of the 1996 IEE International Conference on Evolutionary Computation, Nagoya, Japan, 1996, pp. 616-621.
14. Goldberg, D.E., Genetic Algorithms in Search, Optimisation and Machine Learning, 1989 (Reading, Addison-Wesley: Reading).
15. Graham, R.L., Lawler, E.L., Lenstra, J.K. and Rinnooy Kan, A.H.G., Optimisation and approximation in deterministic sequencing and scheduling theory: a survey. Annals of Discrete Mathematics, 1979, 5, 287-326.
16. Gupta, J.N.D., Strusevich, V.A. and Zwaneveld, C.M., Two-stage scheduling models with setup and removal times separated. Computers & Op. Res., 1997, 24(11), 1025-1031.
17. Hall, N.G. and Sriskandarajah, C., A survey of machine scheduling problems with blocking and no-wait in process. Op. Res., 1996, 44, 510-525.
18. Merz, P. and Freisleben, B., Memetic algorithms and the fitness landscape of the graph bi-partitioning problem, in Proceedings of the 5th International Conference on Parallel Problem Solving from Nature (PPSN V), 1998, pp. 765-774.
19. Moscato, P. and Norman, M.G., A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimisation on message-passing systems. In Parallel Computing and Transputer Applications, edited by M. Valero, E. Onate, M. Jane, J.L. Larriba and B. Suarez, pp. 177-186, 1992 (IOS Press: Amsterdam).
20. Panwalkar, S.S. and Woollam, C.R., Flowshop sequencing problem with no in-process waiting: a special case. J. Op. Res. Soc., 1979, 30, 661-664.
21. Smith, M.L., Panwalkar, S.S. and Dudek, R.A., Flowshop sequencing problem with ordered processing time matrices. Manage. Sci., 1975, 21(5), 544-549.
22. TSPLIB web page, http://www.crpc.rice.edu/softlib/tsplib/
23. Wright, S., The roles of mutation, inbreeding, crossbreeding and selection in evolution, in Proceedings of the 6th International Congress on Genetics, Vol. 1, 1932, pp. 356-366.