An efficient genetic algorithm for job shop scheduling problems
The Job Shop Scheduling Problem (JSSP) is one of the most general and difficult of all traditional scheduling combinatorial problems with considerable importance in industry. When solving complex problems, search based on traditional genetic algorithms has a major drawback - high requirement for com...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Mechanical Engineering in Slavonski Brod, Faculty of Electrical Engineering in Osijek, Faculty of Civil Engineering in Osijek
2017-01-01
|
| Series: | Tehnički Vjesnik |
| Subjects: | |
| Online Access: | https://hrcak.srce.hr/file/273552 |