| DC Element | Wert | Sprache |
|---|
| dc.contributor.author | Brucker, P | |
| dc.contributor.author | Neyer, J | |
| dc.date.accessioned | 2021-12-23T15:58:30Z | - |
| dc.date.available | 2021-12-23T15:58:30Z | - |
| dc.date.issued | 1998 | |
| dc.identifier.issn | 01716468 | |
| dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/3408 | - |
| dc.description.abstract | In a multi-processor-tasks job-shop problem (MPTJSP) there is a machine set associated with each operation. All machines are needed for the whole processing period to process the operation. The objective is to find a schedule which minimizes the makespan. In a multi-mode job-shop problem (MMJSP) there is a set of machine sets associated with each operation. One has to assign a machine set to each operation and to solve the resulting MPTJSP such that the resulting makespan is minimized. For the MMJSP a tabu-search algorithm is presented. Computational results are reported. | |
| dc.language.iso | en | |
| dc.publisher | SPRINGER VERLAG | |
| dc.relation.ispartof | OR SPEKTRUM | |
| dc.subject | multi-mode job-shop | |
| dc.subject | multi-purpose-machine job-shop | |
| dc.subject | multiprocessor-task job-shop | |
| dc.subject | MULTIPURPOSE MACHINES | |
| dc.subject | Operations Research & Management Science | |
| dc.subject | tabu-search | |
| dc.title | Tabu-search for the multi-mode job-shop problem | |
| dc.type | journal article | |
| dc.identifier.isi | ISI:000072064700004 | |
| dc.description.volume | 20 | |
| dc.description.issue | 1 | |
| dc.description.startpage | 21 | |
| dc.description.endpage | 28 | |
| dc.publisher.place | 175 FIFTH AVE, NEW YORK, NY 10010 USA | |
| dcterms.isPartOf.abbreviation | OR Spektrum | |
