Random-Based Scheduling: New Approximations and LP Lower Bounds
| dc.contributor.author | Schulz, Andreas S. | |
| dc.contributor.author | Skutella, Martin | |
| dc.date.accessioned | 2021-12-17T10:08:52Z | |
| dc.date.available | 2021-12-17T10:08:52Z | |
| dc.date.issued | 1997 | |
| dc.description.abstract | Three characteristics encountered frequently in real-world machine scheduling are jobs released over time, precedence constraints between jobs, and average performance optimization. The general constrained one-machine scheduling problem to minimize the average weighted completion time not only captures these features, but also is an important building block for more complex problems involving multiple machines. | en |
| dc.identifier.issn | 2197-8085 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15683 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14456 | |
| dc.language.iso | en | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject.ddc | 510 Mathematik | en |
| dc.subject.other | scheduling | en |
| dc.subject.other | approximations | en |
| dc.subject.other | LP lower bounds | en |
| dc.subject.other | real-world machine scheduling | en |
| dc.subject.other | performance optimization | en |
| dc.title | Random-Based Scheduling: New Approximations and LP Lower Bounds | en |
| dc.type | Research Paper | en |
| dc.type.version | submittedVersion | en |
| tub.accessrights.dnb | free | en |
| tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
| tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
| tub.affiliation.institute | Inst. Mathematik | de |
| tub.publisher.universityorinstitution | Technische Universität Berlin | en |
| tub.series.issuenumber | 1997, 549 | en |
| tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |