JOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINES
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | BRUCKER, P | |
dc.contributor.author | SCHLIE, R | |
dc.date.accessioned | 2021-12-23T15:57:34Z | - |
dc.date.available | 2021-12-23T15:57:34Z | - |
dc.date.issued | 1990 | |
dc.identifier.issn | 0010485X | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/3004 | - |
dc.description.abstract | Consider the following generalization of the classical job-shop scheduling problem in which a set of machines is associated with each operation of a job. The operation can be processed on any of the machines in this set. For each assignment mu of operations to machines let P(mu) be the corresponding job-shop problem and f(mu) be the minimum makespan of P(mu). How to find an assignment which minimizes f(mu)? For problems with two jobs a polynomial algorithm is derived. | |
dc.language.iso | en | |
dc.publisher | SPRINGER-VERLAG WIEN | |
dc.relation.ispartof | COMPUTING | |
dc.subject | Computer Science | |
dc.subject | Computer Science, Theory & Methods | |
dc.subject | FLEXIBLE MANUFACTURING | |
dc.subject | JOB-SHOP SCHEDULING | |
dc.subject | SHORTEST PATH | |
dc.title | JOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINES | |
dc.type | journal article | |
dc.identifier.doi | 10.1007/BF02238804 | |
dc.identifier.isi | ISI:A1990EQ84700008 | |
dc.description.volume | 45 | |
dc.description.issue | 4 | |
dc.description.startpage | 369 | |
dc.description.endpage | 375 | |
dc.publisher.place | SACHSENPLATZ 4-6, PO BOX 89, A-1201 VIENNA, AUSTRIA | |
dcterms.isPartOf.abbreviation | Computing |
Seitenaufrufe
366
Letzte Woche
2
2
Letzter Monat
18
18
geprüft am 02.06.2024