An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems

Computers and Operations Research

Volumn 36, Issue 9, 2009, Pages 2638-2646

  Jarboui, Bassem ^a   Eddaly, Mansour ^a   Siarry, Patrick ^b  

^a UNIVERSITY OF SFAX   (Tunisia)

^b UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

Estimation of distribution algorithm; Flowtime; Permutation flowshop; Scheduling; Variable neighbourhood search

Indexed keywords

ALGORITHMS; ESTIMATION; SCHEDULING;

ESTIMATION OF DISTRIBUTION ALGORITHM; FLOWTIME; NEW TOOLS; PERMUTATION FLOWSHOP; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; TOTAL FLOW TIME; UPPER BOUNDS; VARIABLE NEIGHBOURHOOD SEARCH;

SCHEDULING ALGORITHMS;

EID: 60349125187     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.11.004     Document Type: Article

References (28)

1. Gupta J.N.D., and Stafford Jr. E.F. Flowshop scheduling research after five decades. European Journal of Operational Research 169 (2006) 699-711
2. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 2 (1976) 117-129
3. Chung C.S., Flynn J., and Kirca O. A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems. International Journal of Production Economics 79 (2002) 185-196
4. Van de Velde S.L. Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation. Annals of Operations Research 26 (1990) 257-268
5. Bansal S.P. Minimizing the sum of completion times of n jobs over m machines in a flowshop: a branch and bound approach. AIIE Transactions 9 (1977) 306-311
6. Ignall E., and Schrage L. Application of the branch and bound technique to some flow-shop scheduling problems. Operations Research 13 (1965) 400-412
7. Woo H.S., and Yim D.S. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers and Operations Research 25 (1998) 175-182
8. Framinan J.M., and Leisten R. An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega 31 (2003) 311-317
9. i scheduling problem. European Journal of Operational Research 132 (2001) 439-452
10. Ho C.J., and Gupta J.N.D. Flowshop scheduling with dominant machines. Computers and Operations Research 22 (1995) 237-246
11. Framinan J.M., Leisten R., and Ruiz-Uzano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers and Operations Research 32 (2005) 1237-1254
12. Rajendran C. Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. International Journal of Production Economics 29 (1993) 65-73
13. Allahverdi A., and Aldowaisan T. New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics 77 (2002) 71-83
14. Li X., Wang Q., and Wu C. Efficient composite heuristics for total flowtime minimization in permutation flowshops. Omega 37 (2009) 155-164
15. Vempati V.S., Chen C.L., and Bulllngton S.F. An Effective Heuristic for Flow Shop Problems with Total Flow Time as Criterion. Computers and Industrial Engineering 25 (1993) 219-222
16. Zhang Y, Li X, Wang Q. Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization. European Journal of Operational Research (2008) doi: 10.1016/j.ejor.2008.04.033.
17. Gajpal Y., and Rajendran C. An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. International Journal of Production Economics 101 (2006) 259-272
18. Rajendran C., and Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research 155 (2004) 426-438
19. Jarboui B., Ibrahim S., Siarry P., and Rebai A. A combinatorial particle swarm optimisation for solving permutation flowshop problems. Computers and Industrial Engineering 54 (2008) 526-538
20. Tasgetiren M.F., Liang Y.-C., Sevkli M., and Gencyilmaz G. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177 (2007) 1930-1947
21. Mühlenbein H. Paaß G. From recombination of genes to the estimation of distribution. Binary parameters. In: Lecture notes in computer science 1411: parallel problem solving from nature, PPSN, 1996; IV: p. 178-87.
22. Larraanaga, P., Lozano, J.A., (Eds.). Estimation of distribution algorithms: a new tool for evolutionary computation 2002. Boston/Dordrecht/London: Kluwer Academic Publishers; 2002.
23. Lozano J.A., Larranaga P., Inza I., and Bengoetxea E. Towards a New Evolutionary Computation Advances on Estimation of Distribution Algorithms (2006), Springer, Berlin
24. Mladenović N., and Hansen P. Variable neighborhood search. Computers and Operations Research 24 (1997) 1097-1100
25. Hansen P., and Mladenović N. Variable neighborhood search: principles and applications. European Journal of Operational Research 130 (2001) 449-467
26. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
27. Reeves C.R. A genetic algorithm for flowshop sequencing. Computers and Operations Research 22 (1995) 5-13
28. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285