Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
From MaRDI portal
Publication:1754151
Recommendations
- Pre-emptive scheduling problems with controllable processing times
- A survey of scheduling with controllable processing times
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- Dynamic model and optimal scheduling algorithm for a set of jobs with preemption constraints
- An anticipative scheduling approach with controllable processing times
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
- scientific article; zbMATH DE number 2086932
- A new model for the preemptive earliness-tardiness scheduling problem
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
Cites work
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- A bicriterion approach to time/cost trade-offs in sequencing
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
- A Fast Parametric Maximum Flow Algorithm and Applications
- A new approach to the maximum-flow problem
- A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines
- A survey of results for sequencing problems with controllable processing times
- A survey of scheduling with controllable processing times
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 1302182 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- Improved Algorithms for Bipartite Network Flow
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Machine speed scaling by adapting methods for convex optimization with submodular constraints
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Minimizing Maximum Weighted Error for Imprecise Computation Tasks
- Minimizing mean weighted execution time loss on identical and uniform processors
- Minimizing the number of tardy job units under release time constraints
- Minimizing the weighted number of tardy task units
- Multicriteria scheduling problems: a survey
- Network flows. Theory, algorithms, and applications.
- Optimal flows in networks with multiple sources and sinks
- Pre-emptive scheduling problems with controllable processing times
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- Preemptive Scheduling of Uniform Processor Systems
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- Preemptive Scheduling with Due Dates
- Preemptive Scheduling with Release Times, Deadlines, and Due Times
- Scheduling algorithms
- Scheduling imprecise computation tasks on uniform processors
- Scheduling Independent Tasks with Due Times on a Uniform Processor System
- Scheduling jobs to minimize total cost
- Scheduling with deadlines and loss functions
- Single machine scheduling subject to deadlines and resource dependent processing times
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
- Some comments on sequencing with controllable processing times
- Some simple scheduling algorithms
- Submodular functions and optimization.
Cited in
(33)- A new model for the preemptive earliness-tardiness scheduling problem
- Dynamic model and optimal scheduling algorithm for a set of jobs with preemption constraints
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times
- Single machine resource allocation scheduling problems with deterioration effect and general positional effect
- A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar
- Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Minimizing total weighted late work on a single-machine with non-availability intervals
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- A Review for Submodular Optimization on Machine Scheduling Problems
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
- On a Reduction for a Class of Resource Allocation Problems
- Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times
- Literature reviews in operations research: a new taxonomy and a meta review
- Multi-core processor scheduling with respect to data bus bandwidth
- Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times
- Theory and methodology of time-dependent scheduling: past, present and future
- Two-agent scheduling of minimizing total weighted late work and maximum cost
- Fifty years of research in scheduling -- theory and applications
- Scheduling electric vehicle regular charging tasks: a review of deterministic models
- Approximation schemes for parallel machine scheduling to maximize total weighted early work with a common due date
- A study of different preemption types to facilitate the recovery of personnel task schedules
- Coordinating scheduling and resource allocation decisions in a proportionate flow-shop scheduling environment
- A preemptive single-machine scheduling problem with a late work criterion and convex resource consumption functions
- A linear-time algorithm for a resource-dependent preemptive late-work scheduling problem
- In-house production and outsourcing under different discount schemes on the total outsourcing cost
This page was built for publication: Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754151)
