Loading...
Please wait, while we are loading the content...
Similar Documents
A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
| Content Provider | Semantic Scholar |
|---|---|
| Author | Piersma, Nanda Dijk, W. Van |
| Copyright Year | 1996 |
| Abstract | The parallel machine scheduling problem with unrelated machines is studied where the objective is to minimize the maximum makespan. In this paper, new local search algorithms are proposed where the neighborhood search of a solution uses the ''efficiency'' of the machines for each job. It is shown that this method yields better solutions and shorter running times than the more general local search heuristics. |
| Starting Page | 11 |
| Ending Page | 19 |
| Page Count | 9 |
| File Format | PDF HTM / HTML |
| DOI | 10.1016/0895-7177(96)00150-1 |
| Volume Number | 24 |
| Alternate Webpage(s) | https://repub.eur.nl/pub/67997/1-s2.0-0895717796001501-main.pdf |
| Alternate Webpage(s) | http://repub.eur.nl/pub/67997/1-s2.0-0895717796001501-main.pdf |
| Alternate Webpage(s) | https://doi.org/10.1016/0895-7177%2896%2900150-1 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
