Pages that link to "Item:Q969518"
From MaRDI portal
The following pages link to Complexity of a scheduling problem with controllable processing times (Q969518):
Displaying 9 items.
- Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
- Reducibility among single machine weighted completion time scheduling problems (Q922287) (← links)
- On the complexity of scheduling tasks with discrete starting times (Q1195868) (← links)
- Completion time variance minimization on a single machine is difficult (Q1317023) (← links)
- Complexity of some special types of timetabling problems (Q1600003) (← links)
- Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. (Q1603395) (← links)
- An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103) (← links)
- Control of resource-intensive computations under uncertainty. II. Scheduling complex (Q2017645) (← links)
- The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)