Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines
| Title: | Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines |
|---|---|
| Authors: | Tobias Brueggemann; Johann L. Hurink; Gerhard J. Woeginger; Makespan On Parallel Machines; Jel Code C |
| Contributors: | The Pennsylvania State University CiteSeerX Archives |
| Source: | http://edocs.ub.unimaas.nl/loader/file.asp?id=1209. |
| Publisher Information: | Springer |
| Publication Year: | 2008 |
| Collection: | CiteSeerX |
| Description: | In this paper, we consider the following multiprocessor scheduling problem. Given are n jobs each of which has to be scheduled on one of m identical parallel machines. The time it takes for a job to be fully processed is denoted by pj. A machine can process at most one job at a time, and a job may not be |
| Document Type: | text |
| Language: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.529.961; http://edocs.ub.unimaas.nl/loader/file.asp?id=1209 |
| Availability: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.529.961; http://edocs.ub.unimaas.nl/loader/file.asp?id=1209 |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Accession Number: | edsbas.7DF59AFD |
| Database: | BASE |