Pages that link to "Item:Q3939585"
From MaRDI portal
The following pages link to On Scheduling Independent Tasks with Restricted Execution Times (Q3939585):
Displaying 13 items.
- On-line scheduling with setup costs (Q294721) (← links)
- Optimal packet-to-slot assignment in mobile telecommunications (Q833596) (← links)
- Batch scheduling of step deteriorating jobs (Q835578) (← links)
- Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions (Q835601) (← links)
- Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (Q880502) (← links)
- A state-of-the-art review of parallel-machine scheduling research (Q919994) (← links)
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem (Q991471) (← links)
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
- Scheduling tree-structured tasks with restricted execution times (Q1111371) (← links)
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (Q1266535) (← links)
- On the complexity of scheduling with large communication delays (Q1278302) (← links)
- Packet scheduling in third-generation mobile systems with UTRA-TDD air interface (Q2480204) (← links)
- An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)
