scientific article; zbMATH DE number 3902030
From MaRDI portal
Publication:3680271
Recommendations
- Scheduling preemptable tasks on parallel processors with limited availability
- Preemptive Scheduling of Parallel Jobs on Multiprocessors
- scientific article; zbMATH DE number 871911
- Preemptive scheduling with deadlines on parallel machines
- An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems
- scientific article; zbMATH DE number 1487943
- scientific article; zbMATH DE number 2080263
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
- Parallel Processor Scheduling with Limited Number of Preemptions
- Preemptive scheduling on identical parallel machines subject to deadlines.
Cited in
(50)- Single-machine scheduling with multi-agents to minimize total weighted late work
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
- Scheduling with competing agents, total late work and job rejection
- A parallel machine scheduling problem maximizing total weighted early work
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- A common approximation framework for early work, late work, and resource leveling problems
- On scheduling tasks with associated linear loss functions
- Extra processors versus future information in optimal deadline scheduling
- Open shop scheduling problems with late work criteria.
- Two-machine flow shop scheduling with a common due date to maximize total early work
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- Online early work scheduling on parallel machines
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Two-machine flow-shop scheduling to minimize total late work: revisited
- A survey of due-date related single-machine with two-agent scheduling problem
- Two competitive agents to minimize the weighted total late work and the total completion time
- Minimizing mean weighted execution time loss on identical and uniform processors
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- A note on a two-agent scheduling problem related to the total weighted late work
- A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work
- Minimizing total late work on a single machine with generalized due-dates
- Maximizing total early work in a distributed two‐machine flow‐shop
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Scheduling imprecise computation tasks on uniform processors
- Minimizing the weighted number of tardy task units
- A new perspective on single-machine scheduling problems with late work related criteria
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
- Minimizing total weighted late work on a single-machine with non-availability intervals
- A note on the two machine job shop with the weighted late work criterion
- A single machine scheduling problem to minimize total early work
- A two-agent single-machine scheduling problem with late work criteria
- Scheduling two agents with controllable processing times
- Minimizing total weighted late work in the resource-constrained project scheduling problem
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- Exact approaches to late work scheduling on unrelated machines
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion
- Mirror scheduling problems with early work and late work criteria
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- scientific article; zbMATH DE number 3867043 (Why is no real title available?)
- Minimum loss scheduling problems
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
- Scheduling imprecise computation tasks with \(0/1\)-constraint
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Approximation algorithms for scheduling a single machine to minimize total late work
- A note on a single machine scheduling problem with generalized total tardiness objective function
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680271)
