"On the NP-hardness of scheduling with time restrictions."

An Zhang et al. (2018)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2017.12.001

access: closed

type: Journal Article

metadata version: 2022-08-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/disopt/ZhangCCC18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/ZhangCCC18
An Zhang, Yong Chen, Lin Chen, Guangting Chen:
On the NP-hardness of scheduling with time restrictions. Discret. Optim. 28: 54-62 (2018)

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.