Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop

Andresen, Michael; Bräsel, Heidemarie; Mörig, Marc; Tusch, Jan; Werner, Frank; Willenius, Per

doi:10.1016/j.mcm.2008.01.002

Cited by 50 publications

(29 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In their article they compared the GA with a particular heuristic on small instances. Andresen et al [5] presented a GA for the problem O||∑Ci. They used the rank matrix to encode an individual on their algorithm.…”

Section: Literature Reviewmentioning

confidence: 99%

“…There exist different representations also known as chromosome's encoding. In this study the representation proposed by Andersen et al [5] is reused. Thus the individuals are encoded by a Rank matrix R= (r ij ) that describes a sequence graph G(MO, JO) which is a feasible combination of machine orders and job orders.…”

Section: Figure 1: Genetic Algorithmmentioning

confidence: 99%

“…In the case of ties, a lexicographical order is applied with one exception: The mutated operation gets the smallest number in the linear order among all operations with the same rank. [5][2]…”

Section: Figure 1: Genetic Algorithmmentioning

confidence: 99%

“…These stochastic methods are inspired by analogies from nature like evolutionary algorithms, tabu search, simulated annealing, ant colony optimization, particle swarms, etc. [4] The genetic algorithm proposed in [5] is used in this article to resolve the problem of minimizing the makespan in an openshop O||Cmax [6] by tuning its parameters manually. And compared the results obtained with Taillard's benchmarks in 60 instances where the jobs' number is equal to the machines' number.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Genetic Algorithm Tuning Applied to the Open Shop Scheduling Problem

Mohsine¹,

Benhra²,

Ali³

2016

IJAIS

View full text Add to dashboard Cite

The present paper deals with the open-shop scheduling problem using a manual tuning of a genetic algorithm's parameters. A comparison has been performed between Taillard's Benchmarks for 60 instances, 2 dispatching rules and 198 variants from the GA algorithm obtained by changing the population size, the generation's number, the crossover probability, and the mutation probability. Interesting results were obtained leading to some conclusions for the best choice of the parameters.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Figure 1: Genetic Algorithmmentioning

confidence: 99%

Section: Figure 1: Genetic Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Genetic Algorithm Tuning Applied to the Open Shop Scheduling Problem

Mohsine¹,

Benhra²,

Ali³

2016

IJAIS

View full text Add to dashboard Cite

show abstract

“…Given its NP-hardness for a number of machines m ≥ 3 [19], practical approaches to solving it usually involve heuristic strategies: simulated annealing [1], tabu search [16], genetic algorithms with local search [7], ant colony optimization [2], etc.…”

Section: Introductionmentioning

confidence: 99%

Particle Swarm Optimisation for Open Shop Problems with Fuzzy Durations

Palacios

González-Rodríguez

Vela

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we confront a variation of the open shop problem where task durations are allowed to be uncertain and where uncertainty is modelled using fuzzy numbers. We propose a particle swarm optimization (PSO) approach to minimise the expected makespan using priorities to represent particle position, as well as a decoding algorithm to generate schedules in a subset of possibly active ones. Finally, the performance of the PSO is tested on several benchmark problems, modified so as to have fuzzy durations, compared with a memetic algorithm from the literature.

show abstract

Simulated Annealing Algorithms for the Heterogeneous Robots Task Scheduling Problem in Heterogeneous Robotic Order Fulfillment Systems

Wang

Chen

2022

Lecture Notes in Networks and Systems

View full text Add to dashboard Cite

Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop

Cited by 50 publications

References 27 publications

Genetic Algorithm Tuning Applied to the Open Shop Scheduling Problem

Genetic Algorithm Tuning Applied to the Open Shop Scheduling Problem

Particle Swarm Optimisation for Open Shop Problems with Fuzzy Durations

Simulated Annealing Algorithms for the Heterogeneous Robots Task Scheduling Problem in Heterogeneous Robotic Order Fulfillment Systems

Contact Info

Product

Resources

About