| dc.creator | Franca, PM | |
| dc.creator | Gendreau, M | |
| dc.creator | Laporte, G | |
| dc.creator | Muller, FM | |
| dc.date | 1996 | |
| dc.date | 37043 | |
| dc.date | 2014-12-16T11:35:08Z | |
| dc.date | 2015-11-26T16:28:23Z | |
| dc.date | 2014-12-16T11:35:08Z | |
| dc.date | 2015-11-26T16:28:23Z | |
| dc.date.accessioned | 2018-03-28T23:09:23Z | |
| dc.date.available | 2018-03-28T23:09:23Z | |
| dc.identifier | International Journal Of Production Economics. Elsevier Science Bv, v. 43, n. 41700, n. 79, n. 89, 1996. | |
| dc.identifier | 0925-5273 | |
| dc.identifier | WOS:A1996VG24100001 | |
| dc.identifier | 10.1016/0925-5273(96)00031-X | |
| dc.identifier | http://www.repositorio.unicamp.br/jspui/handle/REPOSIP/53879 | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/53879 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/53879 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1269449 | |
| dc.description | This article deals with the problem of scheduling n jobs on m identical parallel processors with the objective of minimizing the total execution time (makespan). A new three-phase heuristic s proposed for solving this problem. An initial phase constructs a starting solution which is improved, in a second phase, by means of a tabu search method. A final phase follows attempting a further improvement in the current solution. Numerical rests in a series of randomly generated problems indicate that the proposed method outperforms a previous heuristic, Comparisons with an exact procedure attest that our method produces good-quality solutions in reasonable running times. | |
| dc.description | 43 | |
| dc.description | 41700 | |
| dc.description | 79 | |
| dc.description | 89 | |
| dc.language | en | |
| dc.publisher | Elsevier Science Bv | |
| dc.publisher | Amsterdam | |
| dc.publisher | Holanda | |
| dc.relation | International Journal Of Production Economics | |
| dc.relation | Int. J. Prod. Econ. | |
| dc.rights | fechado | |
| dc.rights | http://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy | |
| dc.source | Web of Science | |
| dc.subject | multiprocessor scheduling | |
| dc.subject | local search | |
| dc.subject | tabu search | |
| dc.subject | heuristics | |
| dc.subject | Single-machine | |
| dc.title | A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times | |
| dc.type | Artículos de revistas | |
