Unary NP-hardness of minimizing the number of tardy jobs with deadlines
Year of publication: |
April 2017
|
---|---|
Authors: | Yuan, Jinjiang |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 20.2017, 2, p. 211-218
|
Subject: | Scheduling | Number of tardy jobs | Deadlines | NP-hard | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research | USA | United States | Theorie | Theory |
-
Liu, Ming, (2016)
-
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
Chen, Rubing, (2020)
-
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
Chen, Rubing, (2019)
- More ...
-
Single‐machine scheduling with deadlines to minimize the total weighted late work
Chen, Rubing, (2019)
-
Zhang, Yuan, (2020)
-
Single machine scheduling with job delivery to minimize makespan
Lu, Lingfa, (2008)
- More ...