Scheduling with deadlines and loss functions
From MaRDI portal
Recommendations
- On scheduling tasks with associated linear loss functions
- Minimum loss scheduling problems
- Optimal scheduling with strict deadlines
- AI*IA 2005: Advances in Artificial Intelligence
- Scheduling with Predictions and the Price of Misprediction
- Approximate Deadline-Scheduling with Precedence Constraints
- Deadline Scheduling as Restless Bandits
- scientific article; zbMATH DE number 40475
- Scheduling Jobs That Are Subject to Deterministic Due Dates and Have Deteriorating Expected Rewards
Cited in
(only showing first 100 items - show all)- Preemptive online scheduling: Optimal algorithms for all speeds
- The single-machine total tardiness scheduling problem: review and extensions
- Optimal virtual cluster-based multiprocessor scheduling
- Minimizing the number of machines for minimum length schedules
- An introduction to parallelism in combinatorial optimization
- Minimizing mean flow time with parallel processors and resource constraints
- Openshop and flowshop scheduling to minimize sum of completion times
- Rational preemptive scheduling
- New trends in machine scheduling
- A parametric maximum flow algorithm for bipartite graphs with applications
- Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach
- A survey of scheduling methods for multiprocessor systems
- Scheduling open shops with parallel machines
- Equivalence of mean flow time problems and mean absolute deviation problems
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- Minimum loss scheduling problems
- A heuristic for preemptive scheduling with set-up times
- Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
- Batch scheduling with deadlines on parallel machines
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
- Scheduling multiprocessor tasks with chain constraints
- Minimizing average completion time in the presence of release dates
- A heuristic for the single machine tardiness problem
- Nonclairvoyant scheduling
- A study of the cyclic scheduling problem on parallel processors
- Nearly on line scheduling of preemptive independent tasks
- List scheduling algorithms to minimize the makespan on identical parallel machines
- Real-time scheduling of linear speedup parallel tasks
- Approximate algorithms for the \(P\parallel C_{\max}\) problem
- Is a unit-job shop not easier than identical parallel machines?
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- How useful are preemptive schedules?
- An exact algorithm for the identical parallel machine scheduling problem.
- Parallel machine scheduling with splitting jobs
- Resource augmentation in load balancing.
- Linear and quadratic algorithms for scheduling chains and opposite chains
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- Multi-rate fluid scheduling of mixed-criticality systems on multiprocessors
- Redundant cumulative constraints to compute preemptive bounds
- Energy-efficient real-time scheduling for two-type heterogeneous multiprocessors
- Scheduling chained multiprocessor tasks onto large multiprocessor system
- Minimizing the maximal ergonomic burden in intra-hospital patient transportation
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Parallel machine scheduling with speed-up resources
- Scheduling on parallel machines with preemption and transportation delays
- A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
- Scheduling unrelated parallel machines with optional machines and jobs selection
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
- A polynomial algorithm for an open shop problem with unit processing times and tree constraints
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Scheduling chain-structured tasks to minimize makespan and mean flow time
- Scheduling preemptive jobs with precedence constraints on parallel machines
- Scheduling chains on uniform processors with communication delays
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- An optimal algorithm for preemptive on-line scheduling
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires
- Scheduling with batching: A review
- Scheduling with limited machine availability
- Scheduling multiprocessor tasks for mean flow time criterion
- Uniform parallel machine scheduling with resource consumption constraint
- Algorithms with limited number of preemptions for scheduling on parallel machines
- Ideal schedules in parallel machine settings
- Algorithms for hierarchical and semi-partitioned parallel scheduling
- Makespan minimization with OR-precedence constraints
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
- Preemptive and non-preemptive scheduling on two unrelated parallel machines
- Iterated greedy algorithms for a complex parallel machine scheduling problem
- An optimal online algorithm for scheduling with general machine cost functions
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
- An optimal boundary fair scheduling
- Coupled task scheduling with exact delays: literature review and models
- Modeling single machine preemptive scheduling problems for computational efficiency
- Shop scheduling problems with pliable jobs
- Malleable scheduling for flows of jobs and applications to MapReduce
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
- Parallel machine makespan minimization subject to machine availability and total completion time constraints
- Simultaneous approximation ratios for parallel machine scheduling problems
- How small are shifts required in optimal preemptive schedules?
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
- Green scheduling, flows and matchings
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
- A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- A survey of scheduling with controllable processing times
- Separating online scheduling algorithms with the relative worst order ratio
- The maximum gain of increasing the number of preemptions in multiprocessor scheduling
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
- Schedules with a single preemption on uniform parallel machines
- The benefit of preemption with respect to the \(\ell_p\) norm
- Speed scaling on parallel processors with migration
- Vyacheslav Tanaev: contributions to scheduling and related areas
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
- Parallel machine scheduling with a convex resource consumption function
- Randomized on-line scheduling similar jobs to minimize makespan on two identical processors
This page was built for publication: Scheduling with deadlines and loss functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768989)
