Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
DOI10.1287/MNSC.32.3.341zbMATH Open0603.90071OpenAlexW2157503827MaRDI QIDQ3740552FDOQ3740552
Authors: Awi Federgruen, H. Groenevelt 
Publication date: 1986
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a00020c2865c66c29c5fcba6f8a7a58a55dc867d
Recommendations
maximum latenessdue daterelease timeparallel machinespreemptive schedulingdeadline schedulingprocessing timemaximum flow in a networkscheduling n jobs
Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)
Cited In (43)
- Parallel machine scheduling with machine availability and eligibility constraints
- Scheduling with tails and deadlines
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- Scheduling identical jobs on uniform parallel machines
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
- Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
- Scheduling in multiprocessor systems with additional restrictions
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Planning computations in a multiprocessor system with unfixed parameters
- Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
- Mathematical programming formulations for machine scheduling: A survey
- Minimizing mean weighted execution time loss on identical and uniform processors
- Computation planning in multiprocessor real time automated control systems with an additional resource
- Optimal correction of execution intervals for multiprocessor scheduling with additional resource
- Is a unit-job shop not easier than identical parallel machines?
- Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints
- Preemptive Scheduling of Hybrid Parallel Machines
- Some algorithms for resource allocation in multiprocessor systems
- Computation scheduling in multiprocessor real-time automatic control systems with constrained processor memory
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
- Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph
- Scheduling imprecise computation tasks on uniform processors
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- Preemptive scheduling on uniform machines to minimize mean flow time
- Preemptive Scheduling, Linear Programming and Network Flows
- Continuous flow models for batch manufacturing: a basis for a hierarchical approach
- Title not available (Why is that?)
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
- An algorithm for constructing single processor static-dynamic schedules
- Scheduling on power-heterogeneous processors
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- The battery switching station scheduling problem
- A survey of dynamic network flows
- Synthesizing a multiprocessor system for scheduling with interruptions and execution intervals
- Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
- Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors
- Polymatroidal flow network models with multiple sinks
- A characterization of network representable polymatroids
- A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis
- Title not available (Why is that?)
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)
