"Complexity and approximation algorithms for two parallel dedicated machine ..."

An Zhang et al. (2023)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2022.11.012

access: closed

type: Journal Article

metadata version: 2023-01-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/ZhangZCCW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/ZhangZCCW23
An Zhang, Liang Zhang, Yong Chen, Guangting Chen, Xing Wang:
Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints. Theor. Comput. Sci. 941: 167-179 (2023)

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.