Name
Abstract | ||
|---|---|---|
This paper focus on a complex problem of job shop scheduling where each jobs have a multiple possible operations sequences. The resolution of this type of problem has not been treated in the literature. To solve this, a new algorithm based on Particle Swarm Optimization Global Velocity (PSOVG) was proposed. The objectif is to minimize the makespan. The simulation results show the efficiency of our proposed approach. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-52941-7_55 | PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON HYBRID INTELLIGENT SYSTEMS (HIS 2016) |
Keywords | Field | DocType |
Job-shop scheduling,Multiple operations sequences,PSOVG,Makespan | Particle swarm optimization,Mathematical optimization,Job shop scheduling,Computer science | Conference |
Volume | ISSN | Citations |
552 | 2194-5357 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sana Khalfa | 1 | 0 | 0.34 |
| Nizar Rokbani | 2 | 29 | 6.80 |
| Achraf Jabeur Telmoudi | 3 | 4 | 6.10 |
| Imed Kacem | 4 | 595 | 54.67 |
| Lotfi Nabli | 5 | 0 | 0.34 |
| Alaoui Mdaghri Zoubida | 6 | 0 | 0.34 |