Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs

By Chandrasekharan Rajendran, Hans-Peter Ziegler. European Journal of Operational Research, 2004

457 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/bf32ddd30b77be0ea2940c38868723b39f3113ed

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Industrial and Manufacturing Engineering

Citations in the corpus

A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (2007, methodology): “[24], Miyazaki and Nishiyama [23], Ho and Chang [17], Rajendran and Chaudhuri [34,35], Rajendran [32], Ho [16], Rajendran and Ziegler [36,37], Wang et al.”
A discrete differential evolution algorithm for the permutation flowshop scheduling problem (2007, methodology): “To achieve a better solution quality, modern meta-heuristics have been presented for the PFSP with makespan minimization such as Ant Colony Optimization in [10, 11], Genetic Algorithm in [12, 13, 14], Iterated Local Search in [15], Simulated Annealing in [16, 17], Tabu Search in [18, 19, 20].”
A bicriteria flowshop scheduling with a learning effect (2008, background): “Thereafter, researchers concentrated on developing branch-and-bound and/or heuristic approaches for the flowshop problem with the completion time [19–47].”
Hybrid flow shop scheduling considering machine electricity consumption cost (2013, background): “, 1996), the quadratic assignment problem (Maniezzo and Colorni, 1999) and some scheduling problems (T’kindt et al., 2002; Rajendran and Ziegler, 2004; Ying and Liao, 2004; Chan and Swarnkar, 2006).”
AVE: Autonomous Vehicular Edge Computing Framework with ACO-Based Scheduling (2017, methodology): “The ACO concept has previously been adopted to solve assignment problems [27] and scheduling problems [28] [29] with satisfactory results.”
A discrete version of particle swarm optimization for flowshop scheduling problems (2007, methodology): “The best upper bounds on total flow time reported by Rajendran and Ziegler [13] are utilized for the relative performance evaluation.”
Flowshop-scheduling problems with makespan criterion: a review (2005, background): “Rajendran and Ziegler (2004) considered the problem of scheduling in permutation ﬂowshops with the objective of minimizing the makespan, followed by the consideration of minimization of total ﬂow time of jobs.”
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (2007, methodology): “(1983) to the latest advanced metaheuristics like the ant-colony algorithm of Chandrasekharan and Ziegler (2004). An up-to-date review of flowshop heuristics and metaheuristics can be found in Ruiz and Maroto (2004a).”
The distributed permutation flowshop scheduling problem (2010, methodology): “Iterated Greedy are presented in Rajendran and Ziegler (2004) , Nowicki and Smutnicki (2005), Onwubolu and”
TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM (2006, methodology): “Recently, Rajendran and Ziegler [35] have proposed two very effective ant-colony optimization algorithms and Grabowski and Wodecki [16] a very fast tabu search approach.”