Loading...
Please wait, while we are loading the content...
Similar Documents
A Hybrid Algorithm for Job Shop Scheduling Problem
| Content Provider | Semantic Scholar |
|---|---|
| Author | Toader, Florentina Alina |
| Copyright Year | 2017 |
| Abstract | The Job Shop Scheduling Problem (JSSP) is regarded as one of the most challenging issues by the research community in this field due to its complexity. This paper presents a hybrid algorithm called H-PSO-SA for JSSP which is a mixture of two computational artificial intelligence algorithms: Particle Swarm Optimization and Simulated Annealing. In order to demonstrate efficiency of the proposed hybrid algorithm, a series of tests are conducted using a set of classical JSSP benchmarks. The schedule results are compared with outcomes well known in the scientific literature. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://sic.ici.ro/wp-content/uploads/2015/06/SIC_2015-2-Art5.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Artificial intelligence Hybrid algorithm JSSP Job shop scheduling Particle swarm optimization Phase-shift oscillator Scheduling (computing) Scheduling - HL7 Publishing Domain Scientific literature Simulated annealing Sulfanilamide |
| Content Type | Text |
| Resource Type | Article |
