"The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs ..."

Tianyu Wang, Odile Bellenguez-Morineau (2019)

> Home

Details and statistics

DOI: 10.1007/S10951-018-0596-7

access: closed

type: Journal Article

metadata version: 2023-11-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/scheduling/WangB19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scheduling/WangB19
Tianyu Wang, Odile Bellenguez-Morineau:
The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints. J. Sched. 22(3): 263-269 (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.