A branche and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
Shiqing Yao; Zhibin Jiang; Na Li
| Year of publication: |
2012
|
|---|---|
| Authors: | Yao, Shiqing ; Jiang, Zhibin ; Li, Na |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 39.2012, 5, p. 939-951
|
| Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Durchlaufzeit | Lead time | Operations Research | Operations research |
| Extent: | graph. Darst. |
|---|---|
| Type of publication: | Article |
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://ebvufind01.dmz1.zbw.eu/10010217415