Parallel Simulated Annealing with Genetic Enhancement for flowshop problem with Csum

Computers and Industrial Engineering

Volumn 59, Issue 4, 2010, Pages 778-785

  Czapiński, Michał ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

Parallel algorithm; Permutation flowshop; Simulated Annealing; Total flowtime

Indexed keywords

BENCHMARK DATASETS; COMPUTATIONAL EXPERIMENT; FLOW SHOP PROBLEMS; META HEURISTICS; NEW MECHANISMS; NP COMPLETE; ONE-MACHINE; PARALLEL SIMULATED ANNEALING; PARAMETERS ADJUSTMENT; PERMUTATION FLOW SHOPS; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; TOTAL FLOWTIME;

ANNEALING; CLUSTERING ALGORITHMS; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

SIMULATED ANNEALING;

EID: 78049381838     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2010.08.003     Document Type: Article

References (31)

1. A. Allahverdi, and T. Aldowaisan New heuristics to minimize total completion time in m-machine flowshops International Journal of Production Economics 77 1 2002 71 83 (Pubitemid 34284488)
2. S.P. Bansal Minimizing the sum of completion times of n jobs over m machines in a flowshop - A branch and bound approach IIE Transactions 9 3 1977 306 311
3. W. Boejko Solving the flow shop problem by parallel programming Journal of Parallel and Distributed Computing 2009 10.1016/j.jpdc.2009.01.009
4. Boejko, W., & M. Wodecki (2002). Solving the flow shop problem by parallel tabu search. In: PARELEC '02: proceedings of the international conference on parallel computing in electrical engineering (pp. 189-194). IEEE Computer Society, Washington, DC, USA.
5. W. Boejko, and M. Wodecki Parallel genetic algorithm for the flow shop scheduling problem Lecture Notes in Computer Science 3019 2004 566 571
6. W. Boejko, and M. Wodecki Parallel scatter search algorithm for the flow shop sequencing problem Lecture Notes in Computer Science 4967 2008 180 188
7. C.-S. Chung, J. Flynn, and O. Kirca A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems International Journal of Production Economics 79 3 2002 185 196
8. X. Dong, H. Huang, and P. Chen An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion Computers & Operations Research 36 5 2009 1664 1669
9. J.M. Framinan, R. Leisten, and R. Ruiz-Usano Comparison of heuristics for flowtime minimisation in permutation flowshops Computers & Operations Research 32 5 2005 1237 1254
10. M.R. Garey, D. Johnson, and R. Sethi The complexity of flowshop and jobshop scheduling Mathematics of Operations Research 1 2 1976 117 129
11. E. Ignall, and L. Schrage Application of the branch and bound technique to some flow-shop scheduling problems Operations Research 13 3 1965 400 412
12. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems Computers & Operations Research 36 9 2009 2638 2646
13. B. Jarboui, S. Ibrahim, P. Siarry, and A. Rebai A combinatorial particle swarm optimisation for solving permutation flowshop problems Computers & Industrial Engineering 54 3 2008 526 538
14. S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1 1954 61 68
15. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 220 4598 1983 671 680
16. J. Lemesre, C. Dhaenens, and E. Talbi An exact parallel method for a bi-objective permutation flowshop problem European Journal of Operational Research 177 3 2007 1641 1655 (Pubitemid 44709442)
17. J. Liu, and C.R. Reeves Constructive and composite heuristic solutions to the P ∑ Ci scheduling problem European Journal of Operational Research 132 2 2001 439 452
18. X. Li, Q. Wang, and C. Wu Efficient composite heuristics for total flowtime minimization in permutation flow shops Omega 37 1 2009 155 164
19. M. Nawaz, E.E. Enscore, and I. Ham A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem Omega 11 1 1983 91 95
20. C. Rajendran, and H. Ziegler An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs European Journal of Operational Research 103 1 1997 129 138
21. C. Rajendran, and H. Ziegler Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs European Journal of Operational Research 155 2 2004 426 438
22. J.D. Ram, T.H. Sreenivas, and G.K. Subramaniam Parallel simulated annealing algorithms Journal of Parallel and Distributed Computing 37 2 1996 207 212
23. E. Taillard Benchmarks for basic scheduling problems European Journal of Operational Research 64 2 1993 278 285
24. M.F. Tasgetiren, Y.-C. Liang, M. Sevkli, and G. Gencyilmaz A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem European Journal of Operational Research 177 3 2007 1930 1947
25. L.-Y. Tseng, and Y.-T. Lin A hybrid genetic local search algorithm for the permutation flowshop scheduling problem European Journal of Operational Research 2008 10.1016/j.ejor.2008.08.023
26. E. Vallada, and R. Ruiz Cooperative metaheuristics for the permutation flowshop scheduling problem European Journal of Operational Research 193 2 2009 365 376
27. C. Wang, C. Chu, and J.-M. Proth Heuristic approaches for n / m / F / ∑ Ci scheduling problems European Journal of Operational Research 96 3 1997 636 644
28. M. Wodecki, and W. Boejko Solving the flow shop problem by parallel simulated annealing Lecture Notes in Computer Science 2328 2002 597 600
29. H.-S. Woo, and D.-S. Yim A heuristic algorithm for mean flowtime objective in flowshop scheduling Computers and Operations Research 25 3 1998 175 182
30. sum permutation flowshop scheduling problem by genetic local search. In: Proceedings of 1998 IEEE international conference on evolutionary computation (pp. 230-234).
31. Y. Zhang, X. Li, and Q. Wang Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization European Journal of Operational Research 196 3 2009 869 876