| DC Field | Value | Language |
|---|
| dc.contributor.author | Brucker, P | |
| dc.contributor.author | Thiele, O | |
| dc.date.accessioned | 2021-12-23T15:58:00Z | - |
| dc.date.available | 2021-12-23T15:58:00Z | - |
| dc.date.issued | 1996 | |
| dc.identifier.issn | 01716468 | |
| dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/3265 | - |
| dc.description.abstract | A branch & bound algorithm is presented for a very general scheduling problem with n jobs and m machines. Each job consists of a set of operations. Each operation has to be processed on a dedicated machine. There may be arbitrary precedence relations between the operations. The set of all operations is partitioned into groups. If on a machine an operation belonging to group G(g) is processed immediately after an operation belonging to group G(f) there is a setup of s(fg) time units. We assume that s(fg)=0 if f=g and that the s(fg) satisfy the triangle inequality. Computational results for this general problem as well as for special cases like the job-shop problem and the open-shop problem are reported. | |
| dc.language.iso | en | |
| dc.publisher | SPRINGER VERLAG | |
| dc.relation.ispartof | OR SPEKTRUM | |
| dc.subject | ALGORITHM | |
| dc.subject | block approach | |
| dc.subject | branch & bound method | |
| dc.subject | disjunctive graph model | |
| dc.subject | general-shop problem | |
| dc.subject | immediate selection | |
| dc.subject | job-shop | |
| dc.subject | open-shop | |
| dc.subject | Operations Research & Management Science | |
| dc.subject | sequence dependent setup-times | |
| dc.title | A branch & bound method for the general-shop problem with sequence dependent setup-times | |
| dc.type | journal article | |
| dc.identifier.isi | ISI:A1996UY76800003 | |
| dc.description.volume | 18 | |
| dc.description.issue | 3 | |
| dc.description.startpage | 145 | |
| dc.description.endpage | 161 | |
| dc.publisher.place | 175 FIFTH AVE, NEW YORK, NY 10010 | |
| dcterms.isPartOf.abbreviation | OR Spektrum | |
