JOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINES

DC ElementWertSprache
dc.contributor.authorBRUCKER, P
dc.contributor.authorSCHLIE, R
dc.date.accessioned2021-12-23T15:57:34Z-
dc.date.available2021-12-23T15:57:34Z-
dc.date.issued1990
dc.identifier.issn0010485X
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/3004-
dc.description.abstractConsider 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.isoen
dc.publisherSPRINGER-VERLAG WIEN
dc.relation.ispartofCOMPUTING
dc.subjectComputer Science
dc.subjectComputer Science, Theory & Methods
dc.subjectFLEXIBLE MANUFACTURING
dc.subjectJOB-SHOP SCHEDULING
dc.subjectSHORTEST PATH
dc.titleJOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINES
dc.typejournal article
dc.identifier.doi10.1007/BF02238804
dc.identifier.isiISI:A1990EQ84700008
dc.description.volume45
dc.description.issue4
dc.description.startpage369
dc.description.endpage375
dc.publisher.placeSACHSENPLATZ 4-6, PO BOX 89, A-1201 VIENNA, AUSTRIA
dcterms.isPartOf.abbreviationComputing
Zur Kurzanzeige

Seitenaufrufe

366
Letzte Woche
2
Letzter Monat
18
geprüft am 02.06.2024

Google ScholarTM

Prüfen

Altmetric