Comparing the performance of different meta-heuristics for unweighted parallel machine scheduling
This article considers the due window scheduling problem to minimise the number of early and tardy jobs on identical parallel machines. This problem is known to be NP complete and thus finding an optimal solution is unlikely. Three meta-heuristics and their hybrids are proposed and extensive computa...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Stellenbosch University
2015-08-01
|
| Series: | South African Journal of Industrial Engineering |
| Subjects: | |
| Online Access: | http://sajie.journals.ac.za/pub/article/view/628 |