SELECTING JOBS FOR SCHEDULING ON A MACHINE SUBJECT TO FAILURE
| DC Element | Wert | Sprache |
|---|---|---|
| dc.contributor.author | STADJE, W | |
| dc.date.accessioned | 2021-12-23T15:58:00Z | - |
| dc.date.available | 2021-12-23T15:58:00Z | - |
| dc.date.issued | 1995 | |
| dc.identifier.issn | 0166218X | |
| dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/3267 | - |
| dc.description.abstract | A fixed number n of jobs has to be selected from a set of possible jobs; then the chosen jobs have to be ordered for processing on a single machine which is subject to breakdown. The probability that the machine fails while working on some job J depends on J. To each job there corresponds a reward and a discount factor diminishing the virtual value of future jobs. The objective is to maximize the expected sum of all rewards earned until breakdown. Two algorithms for choosing the n jobs optimally and a method for ordering them are derived. | |
| dc.language.iso | en | |
| dc.publisher | ELSEVIER SCIENCE BV | |
| dc.relation.ispartof | DISCRETE APPLIED MATHEMATICS | |
| dc.subject | BREAKDOWNS | |
| dc.subject | Mathematics | |
| dc.subject | Mathematics, Applied | |
| dc.subject | SINGLE-MACHINE | |
| dc.title | SELECTING JOBS FOR SCHEDULING ON A MACHINE SUBJECT TO FAILURE | |
| dc.type | journal article | |
| dc.identifier.doi | 10.1016/0166-218X(94)00072-7 | |
| dc.identifier.isi | ISI:A1995TJ93600005 | |
| dc.description.volume | 63 | |
| dc.description.issue | 3 | |
| dc.description.startpage | 257 | |
| dc.description.endpage | 265 | |
| dc.publisher.place | PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS | |
| dcterms.isPartOf.abbreviation | Discret Appl. Math. | |
| dcterms.oaStatus | Bronze | |
| crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
| crisitem.author.deptid | fb06 | - |
| crisitem.author.parentorg | Universität Osnabrück | - |
| crisitem.author.netid | StWo325 | - |
Seitenaufrufe
2
Letzte Woche
0
0
Letzter Monat
0
0
geprüft am 07.06.2024
