Minimizing mean weighted execution time loss on identical and uniform processors
From MaRDI portal
Publication:581214
DOI10.1016/0020-0190(87)90145-1zbMath0626.90037OpenAlexW1982759900WikidataQ57387920 ScholiaQ57387920MaRDI QIDQ581214
Publication date: 1987
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(87)90145-1
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items
Minimizing the weighted number of tardy task units ⋮ Semi-online scheduling on two identical machines with a common due date to maximize total early work ⋮ Scheduling imprecise computation tasks on uniform processors ⋮ Two-machine flow-shop scheduling to minimize total late work: revisited ⋮ Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date ⋮ Scheduling imprecise computation tasks with \(0/1\)-constraint ⋮ Scheduling unit-time jobs on processors with different capabilities ⋮ Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work ⋮ A note on the two machine job shop with the weighted late work criterion ⋮ A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Single-machine preemptive scheduling with release dates involving the total weighted late work criterion ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Open shop scheduling problems with late work criteria. ⋮ Preemptive scheduling on uniform parallel machines with controllable job processing times ⋮ Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches ⋮ A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS ⋮ Scheduling two agents with controllable processing times ⋮ The two-machine flow-shop problem with weighted late work criterion and common due date ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Scheduling with Deadlines and Loss Functions
- Towards a Genuinely Polynomial Algorithm for Linear Programming
- Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Preemptive Scheduling of Uniform Processor Systems
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Some simple scheduling algorithms
