Pages that link to "Item:Q1104235"
From MaRDI portal
The following pages link to On a scheduling problem where a job can be executed only by a limited number of processors (Q1104235):
Displaying 12 items.
- Scheduling unit-time jobs on processors with different capabilities (Q1121780) (← links)
- UET-scheduling with constrained processor allocations (Q1185984) (← links)
- Personnel placement in a fuzzy environment (Q1185999) (← links)
- Deterministic multiprocessor scheduling with multiple objectives (Q1195096) (← links)
- Scheduling multiprocessor tasks -- An overview (Q1278297) (← links)
- The \(\beta\)-assignment problems (Q1291693) (← links)
- Scheduling jobs to minimize total cost (Q1330553) (← links)
- The \(\beta\)-assignment problem in general graphs (Q1370666) (← links)
- A new approximation algorithm for UET-scheduling with chain-type precedence constraints. (Q1406686) (← links)
- UET-scheduling with chain-type precedence constraints (Q1919973) (← links)
- Scheduling with constrained processor allocation for interval orders (Q2367418) (← links)
- On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems (Q2484367) (← links)
