default search action
"Unary NP-hardness of preemptive scheduling to minimize total completion ..."
Rubing Chen, Jinjiang Yuan (2021)
- Rubing Chen, Jinjiang Yuan:
Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines. Discret. Appl. Math. 304: 45-54 (2021)
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.