An Ant Colony Algorithm for the Flowshop Scheduling Problem

[1]  Chandrasekharan Rajendran,et al.  A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs , 2005, Eur. J. Oper. Res..

[2]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[3]  N. Anantharaman,et al.  Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems , 2003 .

[4]  Jatinder N. D. Gupta,et al.  A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMES , 2000 .

[5]  C. Liao,et al.  A performance evaluation of permutation vs. non-permutation schedules in a flowshop , 2006 .

[6]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[7]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[8]  Ali Allahverdi,et al.  The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime , 2003, Eur. J. Oper. Res..

[9]  Sheik Meeran,et al.  A multi-level hybrid framework applied to the general flow-shop scheduling problem , 2002, Comput. Oper. Res..

[10]  Hoon-Shik Woo,et al.  A heuristic algorithm for mean flowtime objective in flowshop scheduling , 1998, Comput. Oper. Res..

[11]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[12]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[13]  Christos Koulamas,et al.  A new constructive heuristic for the flowshop scheduling problem , 1998, Eur. J. Oper. Res..