Pages that link to "Item:Q1662160"
From MaRDI portal
The following pages link to On the NP-hardness of scheduling with time restrictions (Q1662160):
Displaying 5 items.
- Random sampling accelerator for attribute reduction (Q2069052) (← links)
- The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
- On the minimum number of resources for a perfect schedule (Q6100682) (← links)
- Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach (Q6106764) (← links)
- EPTAS for parallel identical machine scheduling with time restrictions (Q6123390) (← links)
