Pre-emptive scheduling problems with controllable processing times
From MaRDI portal
Recommendations
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
- Notes on max flow time minimization with controllable processing times
Cites work
- scientific article; zbMATH DE number 1634827 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 724323 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- 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 survey of results for sequencing problems with controllable processing times
- Algorithms for Scheduling Imprecise Computations with Timing Constraints
- An Algorithm for Large Zero-One Knapsack Problems
- Bicriterion Single Machine Scheduling with Resource Dependent Processing Times
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Generalized polymatroids and submodular flows
- Minimization of the makespan in a two-machine problem under given resource constraints
- Minimizing the weighted number of tardy task units
- Positive half-products and scheduling with controllable processing times
- Resource optimal control in some single-machine scheduling problems
- Scheduling jobs with controllable processing times as an optimal control problem
- Scheduling with deadlines and loss functions
- Single machine batch scheduling with resource dependent setup and processing times
- Single machine scheduling subject to deadlines and resource dependent processing times
- Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
- Some comments on sequencing with controllable processing times
- Some simple scheduling algorithms
Cited in
(29)- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
- Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling
- A Review for Submodular Optimization on Machine Scheduling Problems
- Power-aware scheduling for makespan and flow
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
- Open Problem—M/G/1 Scheduling with Preemption Delays
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- 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
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- Positive half-products and scheduling with controllable processing times
- Machine speed scaling by adapting methods for convex optimization with submodular constraints
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
- Batch scheduling of identical jobs with controllable processing times
- Preemptive repayment policy for multiple loans
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- Scheduling two agents with controllable processing times
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- Just-in-time scheduling with controllable processing times on parallel machines
- A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Normal-form preemption sequences for an open problem in scheduling theory
- Scheduling with due date assignment under special conditions on job processing
- Single-machine scheduling with machine unavailability periods and resource dependent processing times
- Notes on max flow time minimization with controllable processing times
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times
This page was built for publication: Pre-emptive scheduling problems with controllable processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880501)
