Optimization of Makespan in Job Shop Scheduling Problem by Golden Ball Algorithm
Job shop scheduling problem (JSSP) is considered to belong to the class of NP-hard combinatorial optimization problem. Finding a solution to this problem is equivalent to solving different problems of various fields such as industry and logistics. The objective of this work is to optimize the makesp...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | EJournal Article |
| Published: |
Institute of Advanced Engineering and Science,
2016-12-01.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |