Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
From MaRDI portal
(Redirected from Publication:747774)
Recommendations
- Handling scheduling problems with controllable parameters by methods of submodular optimization
- A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1302182 (Why is no real title available?)
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- 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
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Pre-emptive scheduling problems with controllable processing times
- Preemptive Scheduling of Uniform Processor Systems
- Preemptive Scheduling with Due Dates
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
- Scheduling Independent Tasks with Due Times on a Uniform Processor System
- Scheduling algorithms
- Scheduling jobs to minimize total cost
- Scheduling with deadlines and loss functions
- Single machine scheduling subject to deadlines and resource dependent processing times
- Submodular functions and optimization.
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
Cited in
(13)- On Submodular Search and Machine Scheduling
- Handling scheduling problems with controllable parameters by methods of submodular optimization
- A Review for Submodular Optimization on Machine Scheduling Problems
- Min-max controllable risk problems
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
- Machine speed scaling by adapting methods for convex optimization with submodular constraints
- Min‐sum controllable risk problems with concave risk functions of the same value range
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines
- Single machine resource allocation scheduling problems with deterioration effect and general positional effect
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times
This page was built for publication: Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747774)
