Approximation schemes for scheduling on parallel machines
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1405790
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- Improved approximation schemes for scheduling unrelated parallel machines
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Approximation schemes for scheduling and covering on unrelated machines
Cited in
(only showing first 100 items - show all)- On-line scheduling with extendable working time on a small number of machines
- Complexity of min-max subsequence problems
- Power-aware scheduling for makespan and flow
- A parallel approximation scheme for the multiprocessor scheduling problem
- Approximation algorithms for shop scheduling problems with minsum objective
- On the optimality of exact and approximation algorithms for scheduling problems
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Approximation for scheduling on uniform nonsimultaneous parallel machines
- Metaheuristics for order scheduling problem with unequal ready times
- Vector scheduling with rejection on a single machine
- Approximation schemes for the min-max starting time problem
- Scheduling reclaimer operations in the stockyard to minimize makespan
- Parameterized complexity of machine scheduling: 15 open problems
- Approximation schemes for scheduling on uniformly related and identical parallel machines
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Approximation algorithms for the multiprocessor scheduling with submodular penalties
- Speed-robust scheduling. Sand, bricks, and rocks
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- Empowering the configuration-IP: new PTAS results for scheduling with setup times
- In memoriam: Gerhard Woeginger (1964--2022)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs
- Approximation algorithms for simple assembly line balancing problems
- Exact and meta-heuristic approaches for the production leveling problem
- An additive approximation scheme for the Nash social welfare maximization with identical additive valuations
- The longest processing time rule for identical parallel machines revisited
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints
- Parallel machine scheduling with nested job assignment restrictions
- A unified view of parallel machine scheduling with interdependent processing rates
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Simultaneous approximation ratios for parallel machine scheduling problems
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path
- A new approach for bicriteria partitioning problem
- Approximation schemes for a class of subset selection problems
- Parallel machine scheduling with restricted job rejection
- Approximation and online algorithms for multidimensional bin packing: a survey
- A unified framework for designing EPTAS for load balancing on parallel machines
- The benefit of preemption with respect to the \(\ell_p\) norm
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
- Scheduling of pipelined operator graphs
- Vector assignment schemes for asymmetric settings
- Approximation schemes for scheduling and covering on unrelated machines
- Load balancing of temporary tasks in the \(\ell _{p}\) norm
- Optimal preemptive scheduling for general target functions
- Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
- Approximations and auctions for scheduling batches on related machines
- Parameterized complexity of configuration integer programs
- Fair and efficient allocation with few agent types, few item types, or small value levels
- Speed-robust scheduling: sand, bricks, and rocks
- A unified approach to truthful scheduling on related machines
- Approximation schemes for robust makespan scheduling problems
- A PTAS for minimizing the weighted sum of job completion times on parallel machines
- Approximation algorithms for scheduling and packing problems
- An efficient PTAS for parallel machine scheduling with capacity constraints
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
- An improved approximation scheme for the Johnson problem with parallel machines
- Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
- Closing the gap for makespan scheduling via sparsification techniques
- A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines
- Non-preemptive scheduling on machines with setup times
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION
- scientific article; zbMATH DE number 4011924 (Why is no real title available?)
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- On multiprocessor temperature-aware scheduling problems
- Approximation Algorithms For Scheduling On Uniform Processors
- Approximation algorithms for scheduling arithmetic expressions on pipelined machines
- scientific article; zbMATH DE number 1182760 (Why is no real title available?)
- scientific article; zbMATH DE number 1982192 (Why is no real title available?)
- scientific article; zbMATH DE number 1760037 (Why is no real title available?)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines
- Two approximation schemes for scheduling on parallel machines under a grade of service provision
- Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
- scientific article; zbMATH DE number 1839470 (Why is no real title available?)
- scientific article; zbMATH DE number 1894930 (Why is no real title available?)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs
- scientific article; zbMATH DE number 1405790 (Why is no real title available?)
- Simpler and Better Algorithms for Minimum-Norm Load Balancing
- Empowering the configuration-IP -- new PTAS results for scheduling with setups times
- Scheduling to approximate minimization objectives on identical machines
- New algorithmic results for bin packing and scheduling
- Algorithm Theory - SWAT 2004
- Approximating Real-Time Scheduling on Identical Machines
- Mathematical Foundations of Computer Science 2003
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Polynomial-time approximation schemes for scheduling problems with time lags
- High-multiplicity \(N\)-fold IP via configuration LP
- EPTAS for the dual of splittable bin packing with cardinality constraint
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs
- scientific article; zbMATH DE number 7758357 (Why is no real title available?)
- Scheduling task-tree with additive scales on parallel/distributed machines
- EPTAS for load balancing problem on parallel machines with a non-renewable resource
- Improved bounds for stochastic extensible bin packing under distributional assumptions
- A state-of-the-art survey on multi-scenario scheduling
- EPTAS for parallel identical machine scheduling with time restrictions
- Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
- Approximation scheme for single-machine rescheduling with job delay and rejection
- Scheduling with machine conflicts
- Tight bounds for selfish and greedy load balancing
- Bag-of-tasks scheduling with rejection in large computing systems
- Load balancing: the long road from theory to practice
This page was built for publication: Approximation schemes for scheduling on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268852)
