Fast approximation algorithms for uniform machine scheduling with processing set restrictions
Joseph Y-T. Leung, C.T. Ng
| Year of publication: |
16 July 2017
|
|---|---|
| Authors: | Leung, Joseph Y-T. ; Ng, C. T. |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 260.2017, 2 (16.7.), p. 507-513
|
| Subject: | Scheduling | Uniform machines | Inclusive processing set | Tree-hierarchical processing set | Makespan | Worst-case bound | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Durchlaufzeit | Lead time | Produktionssteuerung | Production control | Prozessmanagement | Business process management |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2017.01.013 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011698643