Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
From MaRDI portal
Publication:1754151
DOI10.1016/j.ejor.2017.08.034zbMath1403.90365OpenAlexW2749593191WikidataQ59884019 ScholiaQ59884019MaRDI QIDQ1754151
Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.08.034
scheduling with controllable processing timesflows in networksoptimization with submodular constraintsscheduling with imprecise computation
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
In-house production and outsourcing under different discount schemes on the total outsourcing cost, 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, On a Reduction for a Class of Resource Allocation Problems, Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times, Unrelated parallel machine scheduling problem with special controllable processing times and setups, Literature reviews in operations research: a new taxonomy and a meta review, Multi-core processor scheduling with respect to data bus bandwidth, Single-machine scheduling with multi-agents to minimize total weighted late work, Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques, 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, A Review for Submodular Optimization on Machine Scheduling Problems, 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, 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, A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing mean weighted execution time loss on identical and uniform processors
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
- Pre-emptive scheduling problems with controllable processing times
- A survey of results for sequencing problems with controllable processing times
- Minimizing the number of tardy job units under release time constraints
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- A bicriterion approach to time/cost trade-offs in sequencing
- Single machine scheduling subject to deadlines and resource dependent processing times
- Minimizing the weighted number of tardy task units
- Scheduling jobs to minimize total cost
- Some comments on sequencing with controllable processing times
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- Scheduling imprecise computation tasks on uniform processors
- A survey of scheduling with controllable processing times
- Submodular functions and optimization.
- Scheduling with Deadlines and Loss Functions
- Multicriteria scheduling problems: a survey
- Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- A new approach to the maximum-flow problem
- Preemptive Scheduling with Due Dates
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Scheduling Independent Tasks with Due Times on a Uniform Processor System
- Preemptive Scheduling with Release Times, Deadlines, and Due Times
- Optimal flows in networks with multiple sources and sinks
- Preemptive Scheduling of Uniform Processor Systems
- Minimizing Maximum Weighted Error for Imprecise Computation Tasks
- Improved Algorithms for Bipartite Network Flow
- Some simple scheduling algorithms
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
- A Fast Parametric Maximum Flow Algorithm and Applications
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
- Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints
- A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines
