On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
Gur Mosheiov, Daniel Oron, Dvir Shabtay
| Year of publication: |
2022
|
|---|---|
| Authors: | Mosheiov, Gur ; Oron, Daniel ; Shabtay, Dvir |
| Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 25.2022, 5, p. 577-587
|
| Subject: | N P-hard | Generalized due-dates | Parameterized complexity. | Pseudo-polynomial time algorithm | Scheduling | Single machine | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm |
freely available
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1007/s10951-022-00743-9 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10013453936