Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
DOI10.1002/NET.22202OpenAlexW4390055875MaRDI QIDQ6196891FDOQ6196891
Authors: Akiyoshi Shioura, V. A. Strusevich, N. V. Shakhlevich 
Publication date: 15 March 2024
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22202
Recommendations
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- Preemptive scheduling on identical parallel machines subject to deadlines.
- Preemptive scheduling on uniform machines to minimize mean flow time
- Preemptive scheduling with deadlines on parallel machines
- Preemptive Scheduling, Linear Programming and Network Flows
optimality conditionspreemptionscheduling with controllable processing timesparallel-machine schedulingmaximum-flow problemminimum-cut problemscheduling under resource constraints
Cites Work
- Title not available (Why is that?)
- Max flows in \(O(nm)\) time, or better
- Scheduling subject to resource constraints: Classification and complexity
- Scheduling with deadlines and loss functions
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- Some simple scheduling algorithms
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Scheduling preemptable tasks on parallel processors with limited availability
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- Approximation of the parallel machine scheduling problem with additional unit resources
- Parallel machine scheduling with machine availability and eligibility constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
- Preemptive Scheduling with Due Dates
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
- Preemptive scheduling with dedicated processors: applications of fractional graph coloring
This page was built for publication: Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196891)
