Approximate algorithms for the P C_ problem
From MaRDI portal
Publication:1367883
Recommendations
- scientific article; zbMATH DE number 2162223
- Approximation algorithms for scheduling parallel jobs
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem
- Approximation algorithms for scheduling unrelated parallel machines
- Parallel machines scheduling with nonsimultaneous machine available time
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 3521517 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A state-of-the-art review of parallel-machine scheduling research
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- An Application of Bin-Packing to Multiprocessor Scheduling
- Bounds for Certain Multiprocessing Anomalies
- Fast algorithms for bin packing
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling with deadlines and loss functions
- The Asymptotic Optimality of the LPT Rule
- The rate of convergence to optimality of the LPT rule
Cited in
(16)- scientific article; zbMATH DE number 2077623 (Why is no real title available?)
- Parallel algorithms for solution of problems in scheduling theory
- List scheduling algorithms to minimize the makespan on identical parallel machines
- scientific article; zbMATH DE number 1226311 (Why is no real title available?)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem
- Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
- scientific article; zbMATH DE number 1094167 (Why is no real title available?)
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
- scientific article; zbMATH DE number 3974707 (Why is no real title available?)
- scientific article; zbMATH DE number 2162223 (Why is no real title available?)
- Automata, Languages and Programming
- Approximation algorithms for \(k\)-hurdle problems
- Approximating the discrete resource sharing scheduling problem
- scientific article; zbMATH DE number 1304324 (Why is no real title available?)
- scientific article; zbMATH DE number 6129431 (Why is no real title available?)
This page was built for publication: Approximate algorithms for the \(P\parallel C_{\max}\) problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367883)
