"Unary NP-hardness of single-machine scheduling to minimize the total ..."

Rubing Chen, Jinjiang Yuan (2019)

> Home

Details and statistics

DOI: 10.1007/S10951-019-00615-9

access: closed

type: Journal Article

metadata version: 2020-04-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/ChenY19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/ChenY19
Rubing Chen, Jinjiang Yuan:
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines. J. Sched. 22(5): 595-601 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.