Unary NP-hardness of minimizing the number of tardy jobs with deadlines

Jinjiang Yuan

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

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10011691589

A service of the