Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work
Rubing Chen, Yuan Gao, Zhichao Geng, Jinjiang Yuan
| Year of publication: |
2023
|
|---|---|
| Authors: | Chen, Rubing ; Gao, Yuan ; Geng, Zhichao ; Yuan, Jinjiang |
| Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 61.2023, 22, p. 7630-7648
|
| Subject: | algorithms | assignable/generalized due dates | NP-hard | Scheduling | total weighted late work | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Durchlaufzeit | Lead time |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1080/00207543.2022.2160502 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10014383411