Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
From MaRDI portal
(Redirected from Publication:3740552)
Recommendations
Cited in
(47)- Preemptive scheduling on uniform machines to minimize mean flow time
- Is a unit-job shop not easier than identical parallel machines?
- Scheduling on power-heterogeneous processors
- Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors
- Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- An algorithm for constructing single processor static-dynamic schedules
- Scheduling in multiprocessor systems with additional restrictions
- The battery switching station scheduling problem
- Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- Synthesizing a multiprocessor system for scheduling with interruptions and execution intervals
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
- Scheduling imprecise computation tasks on uniform processors
- Parallel machine scheduling with machine availability and eligibility constraints
- Computation scheduling in multiprocessor real-time automatic control systems with constrained processor memory
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
- Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
- Planning computations in a multiprocessor system with unfixed parameters
- Scheduling identical jobs on uniform parallel machines
- scientific article; zbMATH DE number 3883931 (Why is no real title available?)
- Preemptive Scheduling, Linear Programming and Network Flows
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
- scientific article; zbMATH DE number 4023000 (Why is no real title available?)
- Polymatroidal flow network models with multiple sinks
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- Preemptive Scheduling of Hybrid Parallel Machines
- Continuous flow models for batch manufacturing: a basis for a hierarchical approach
- Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
- Optimal correction of execution intervals for multiprocessor scheduling with additional resource
- Computation planning in multiprocessor real time automated control systems with an additional resource
- A characterization of network representable polymatroids
- A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Minimizing mean weighted execution time loss on identical and uniform processors
- Scheduling with tails and deadlines
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
- Fifty years of research in scheduling -- theory and applications
- Scheduling electric vehicle regular charging tasks: a review of deterministic models
- Mathematical programming formulations for machine scheduling: A survey
- Some algorithms for resource allocation in multiprocessor systems
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- A survey of dynamic network flows
- Preemptive scheduling on uniform parallel machines with controllable job processing times
This page was built for publication: Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740552)
