Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
type: Item
instance of: scholarly article
title: Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
zbMATH Open document ID: 1403.90365
author: Akiyoshi Shioura
author: N. V. Shakhlevich
author: V. A. Strusevich
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6876592
zbMATH Keywords: scheduling with controllable processing times
zbMATH Keywords: scheduling with imprecise computation
zbMATH Keywords: flows in networks
zbMATH Keywords: optimization with submodular constraints
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.08.034
OpenAlex ID: W2749593191
Wikidata QID: Q59884019
cites work: Q3056948
cites work: Improved Algorithms for Bipartite Network Flow
cites work: Q3680271
cites work: Minimizing mean weighted execution time loss on identical and uniform processors
cites work: Q3425131
cites work: Scheduling jobs to minimize total cost
cites work: Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
cites work: Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
cites work: Submodular functions and optimization.
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: A new approach to the maximum-flow problem
cites work: Preemptive Scheduling of Uniform Processor Systems
cites work: A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
cites work: Minimizing Maximum Weighted Error for Imprecise Computation Tasks
cites work: About strongly polynomial time algorithms for quadratic optimization over submodular constraints
cites work: Minimizing the number of tardy job units under release time constraints
cites work: Some comments on sequencing with controllable processing times
cites work: Some simple scheduling algorithms
cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
cites work: Single machine scheduling subject to deadlines and resource dependent processing times
cites work: Approximation schemes for parallel machine scheduling problems with controllable processing times
cites work: Q4058442
cites work: Q4247449
cites work: Q3995531
cites work: Q4821818
cites work: Minimizing the weighted number of tardy task units
cites work: Preemptive Scheduling with Release Times, Deadlines, and Due Times
cites work: Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
cites work: Scheduling with deadlines and loss functions
cites work: Optimal flows in networks with multiple sources and sinks
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: A survey of results for sequencing problems with controllable processing times
cites work: A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
cites work: Preemptive Scheduling with Due Dates
cites work: Scheduling Independent Tasks with Due Times on a Uniform Processor System
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: A survey of scheduling with controllable processing times
cites work: SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
cites work: Pre-emptive scheduling problems with controllable processing times
cites work: Preemptive scheduling on uniform parallel machines with controllable job processing times
cites work: Algorithms for Scheduling Imprecise Computations with Timing Constraints
cites work: A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines
cites work: Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
cites work: Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
cites work: Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints
cites work: Multicriteria scheduling problems: a survey
cites work: A bicriterion approach to time/cost trade-offs in sequencing
cites work: Scheduling imprecise computation tasks on uniform processors
DBLP publication ID: journals/eor/ShiouraSS18
DOI: 10.1016/J.EJOR.2017.08.034
Recommended article: Pre-emptive scheduling problems with controllable processing times
Recommended article: A survey of scheduling with controllable processing times
Recommended article: Preemptive scheduling on uniform parallel machines with controllable job processing times
Recommended article: Dynamic model and optimal scheduling algorithm for a set of jobs with preemption constraints
Recommended article: An anticipative scheduling approach with controllable processing times
Recommended article: On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
Recommended article: Q4737537
Recommended article: A new model for the preemptive earliness-tardiness scheduling problem

Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Recommended article)
Recommended article: Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
Similarity Score: 0.8650863
Recommender Run: Recommender Run 3

Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Recommended article)
Recommended article: A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
Similarity Score: 0.8643908
Recommender Run: Recommender Run 3