default search action
"Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated ..."
René Sitters (2001)
- René Sitters:
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines. IPCO 2001: 396-405
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.