A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan
Onur Ozturk, Mehmet A. Begen and Gregory S. Zaric
| Year of publication: |
1-15 March 2017
|
|---|---|
| Authors: | Ozturk, Onur ; Begen, Mehmet A. ; Zaric, Gregory S. |
| Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 55.2017, 5/6 (1/15.3.), p. 1815-1831
|
| Subject: | scheduling | batch scheduling | parallel machines | makespan | branch and bound | heuristics | mathematical programming | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Operations Research | Operations research | Produktionssteuerung | Production control |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1080/00207543.2016.1253889 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011628422