A novel parallel quantum genetic algorithm for stochastic job shop scheduling (Q1018336)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5555236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A novel parallel quantum genetic algorithm for stochastic job shop scheduling |
scientific article; zbMATH DE number 5555236 |
Statements
A novel parallel quantum genetic algorithm for stochastic job shop scheduling (English)
0 references
19 May 2009
0 references
The paper investigates the so-called job-shop-scheduling problem, i.e., there is a certain number of jobs that have to be completed on a given number of machines according to a given sequence of operations. The processing times of the jobs on the machines are assumed to be normally distributed. The objective is to find a strategy that minimizes the sum of the expected completion times for the jobs. To solve this problem a parallel quantum genetic algorithm is proposed. The performance of the algorithm is tested by means of three ``standard benchmark problems'' using simulations.
0 references
migration strategy
0 references
penetration theory
0 references
simulation
0 references
0.9455011
0 references
0.91300416
0 references
0.88044745
0 references
0.8764132
0 references
0.8680477
0 references
0.8660863
0 references
