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

Gupta, 2006, Flowshop scheduling research after five decades, European Journal of Operational Research, 169, 699, 10.1016/j.ejor.2005.02.001 Garey, 1976, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 2, 117, 10.1287/moor.1.2.117 Chung, 2002, A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems, International Journal of Production Economics, 79, 185, 10.1016/S0925-5273(02)00234-7 Van de Velde, 1990, Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation, Annals of Operations Research, 26, 257, 10.1007/BF03500931 Bansal, 1977, Minimizing the sum of completion times of n jobs over m machines in a flowshop: a branch and bound approach, AIIE Transactions, 9, 306, 10.1080/05695557708975160 Ignall, 1965, Application of the branch and bound technique to some flow-shop scheduling problems, Operations Research, 13, 400, 10.1287/opre.13.3.400 Woo, 1998, A heuristic algorithm for mean flowtime objective in flowshop scheduling, Computers and Operations Research, 25, 175, 10.1016/S0305-0548(97)00050-6 Framinan, 2003, An efficient constructive heuristic for flowtime minimisation in permutation flow shops, Omega, 31, 311, 10.1016/S0305-0483(03)00047-1 Liu, 2001, Constructive and composite heuristic solutions to the P|∑Ci scheduling problem, European Journal of Operational Research, 132, 439, 10.1016/S0377-2217(00)00137-5 Ho, 1995, Flowshop scheduling with dominant machines, Computers and Operations Research, 22, 237, 10.1016/0305-0548(94)E0007-T Framinan, 2005, Comparison of heuristics for flowtime minimisation in permutation flowshops, Computers and Operations Research, 32, 1237, 10.1016/j.cor.2003.11.002 Rajendran, 1993, Heuristic algorithm for scheduling in a flowshop to minimize total flowtime, International Journal of Production Economics, 29, 65, 10.1016/0925-5273(93)90024-F Allahverdi, 2002, New heuristics to minimize total completion time in m-machine flowshops, International Journal of Production Economics, 77, 71, 10.1016/S0925-5273(01)00228-6 Li, 2009, Efficient composite heuristics for total flowtime minimization in permutation flowshops, Omega, 37, 155, 10.1016/j.omega.2006.11.003 Vempati, 1993, An Effective Heuristic for Flow Shop Problems with Total Flow Time as Criterion, Computers and Industrial Engineering, 25, 219, 10.1016/0360-8352(93)90260-5 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. Gajpal, 2006, An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops, International Journal of Production Economics, 101, 259, 10.1016/j.ijpe.2005.01.003 Rajendran, 2004, Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs, European Journal of Operational Research, 155, 426, 10.1016/S0377-2217(02)00908-6 Jarboui, 2008, A combinatorial particle swarm optimisation for solving permutation flowshop problems, Computers and Industrial Engineering, 54, 526, 10.1016/j.cie.2007.09.006 Tasgetiren, 2007, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, European Journal of Operational Research, 177, 1930, 10.1016/j.ejor.2005.12.024 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. Larraanaga, P., Lozano, J.A., (Eds.). Estimation of distribution algorithms: a new tool for evolutionary computation 2002. Boston/Dordrecht/London: Kluwer Academic Publishers; 2002. Lozano, 2006 Mladenović, 1997, Variable neighborhood search, Computers and Operations Research, 24, 1097, 10.1016/S0305-0548(97)00031-2 Hansen, 2001, Variable neighborhood search: principles and applications, European Journal of Operational Research, 130, 449, 10.1016/S0377-2217(00)00100-4 Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: a survey, Annals of Discrete Mathematics, 5, 287, 10.1016/S0167-5060(08)70356-X Reeves, 1995, A genetic algorithm for flowshop sequencing, Computers and Operations Research, 22, 5, 10.1016/0305-0548(93)E0014-K Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M