A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint
Ju-Young Lee and Yeong-Dae Kim (Korea Advanced Institute of Science and Technology (KAIST), Daejeon, Korea)
| Year of publication: |
September 2015
|
|---|---|
| Authors: | Lee, Ju-Yong ; Kim, Yeong-Dae |
| Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 66.2015, 9, p. 1542-1554
|
| Subject: | scheduling | identical parallel machines | availability constraint | total tardiness | branch and bound | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Theorie | Theory | Produktionssteuerung | Production control | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1057/jors.2014.122 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011417478