Pages that link to "Item:Q3740552"
From MaRDI portal
The following pages link to Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques (Q3740552):
Displayed 33 items.
- Planning computations in a multiprocessor system with unfixed parameters (Q290006) (← links)
- Optimal correction of execution intervals for multiprocessor scheduling with additional resource (Q499147) (← links)
- Computation planning in multiprocessor real time automated control systems with an additional resource (Q499572) (← links)
- Minimizing mean weighted execution time loss on identical and uniform processors (Q581214) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Some algorithms for resource allocation in multiprocessor systems (Q845541) (← links)
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints (Q868990) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
- Is a unit-job shop not easier than identical parallel machines? (Q1392555) (← links)
- Scheduling on power-heterogeneous processors (Q1680505) (← links)
- Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors (Q1706041) (← links)
- Combinatorial optimization algorithms combining greedy strategies with a limited search procedure (Q1745806) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem (Q1771351) (← links)
- An algorithm for constructing single processor static-dynamic schedules (Q1789208) (← links)
- Scheduling in multiprocessor systems with additional restrictions (Q1795622) (← links)
- The battery switching station scheduling problem (Q1939710) (← links)
- Some algorithms for analysis and synthesis of real-time multiprocessor computing systems (Q2017764) (← links)
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
- Synthesizing a multiprocessor system for scheduling with interruptions and execution intervals (Q2290480) (← links)
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows (Q2378457) (← links)
- Scheduling imprecise computation tasks on uniform processors (Q2379995) (← links)
- Parallel machine scheduling with machine availability and eligibility constraints (Q2384614) (← links)
- Computation scheduling in multiprocessor real-time automatic control systems with constrained processor memory (Q2487495) (← links)
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows (Q2503223) (← links)
- Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph (Q2508774) (← links)
- Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines (Q2806872) (← links)
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133) (← links)
- Polymatroidal flow network models with multiple sinks (Q3796942) (← links)
- Continuous flow models for batch manufacturing: a basis for a hierarchical approach (Q4398998) (← links)
- A characterization of network representable polymatroids (Q5202490) (← links)
- Scheduling with tails and deadlines (Q5937434) (← links)