| Title of Article |
Metaheuristics for Scheduling Unrelated Parallel Machines with Sequence-Dependent Setup Time and Machine Eligibility |
| Date of Acceptance |
17 November 2015 |
| Journal |
| Title of Journal |
CMUJ NS Special Issue on Logistics and Supply Chain Systems (2015) Vol.14(4) |
| Standard |
SCOPUS |
| Institute of Journal |
Chiang Mai University |
| ISBN/ISSN |
|
| Volume |
2015 |
| Issue |
|
| Month |
December |
| Year of Publication |
2016 |
| Page |
431 |
| Abstract |
This research focuses on the parallel machines scheduling problem in
the hard disk drive industry, with the objective of minimizing the makespan. In
this problem, unrelated parallel machines with sequence-dependent setup time
and machine eligibility are considered. This problem can be formulated as a deterministic Rm|Mj,Sjk|Cmax problem. To solve the problem, a mathematical model is developed for small-sized problems. For large-scale problems, algorithms
based on a constructive heuristic (Unrelated Parallel Machines with Sequence-Dependent Setup Times and Machine eligibility (UPSDSTM)) and Differential Evolution (DE) are applied. The results demonstrate that the DE algorithm is very efficient. It yields higher relative improvement (RI) on the makespan. |
| Keyword |
Heuristic algorithm, Makespan, Differential evolution algorithm |
| Author |
|
| Reviewing Status |
มีผู้ประเมินอิสระ |
| Status |
ได้รับการตอบรับให้ตีพิมพ์ |
| Level of Publication |
นานาชาติ |
| citation |
true |
| Part of thesis |
true |
| Attach file |
|
| Citation |
0
|
|
|
Publication
Journal Publication
ไทย