Exact and Approximate Algorithms for Scheduling Nonidentical Processors

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited In (only showing first 100 items - show all)

Polynomial time approximation algorithms for machine scheduling: Ten open problems
Moderately exponential approximation for makespan minimization on related machines
Penalty cost constrained identical parallel machine scheduling problem
Scheduling on machines with variable service rates
Improved price of anarchy for machine scheduling games with coordination mechanisms
Grouping techniques for scheduling problems: simpler and faster
The price of anarchy for utilitarian scheduling games on related machines
Vertex cover meets scheduling
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Heuristics for scheduling unrelated parallel machines
Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
Approximation algorithms for scheduling unrelated parallel machines
Scheduling parallel machines with inclusive processing set restrictions and job release times
Approximation schemes for subset-sums ratio problems
Efficient scheduling of tasks without full use of processor resources
A lower bound of \(1+\varphi \) for truthful scheduling mechanisms
Optimal location with equitable loads
Tighter approximation bounds for LPT scheduling in two special cases
Mathematical programming formulations for machine scheduling: A survey
General approximation algorithms for some arithmetical combinatorial problems
Algorithmic mechanism design
A note on MULTIFIT scheduling for uniform machines
Approximation schemes for scheduling and covering on unrelated machines
Planning production using mathematical programming: The case of a woodturning company
Worst-case analysis for on-line service policies
Approximation schemes for a class of subset selection problems
Computing Nash equilibria for scheduling on restricted parallel links
An efficient polynomial time approximation scheme for load balancing on uniformly related machines
Analysis of a linear programming heuristic for scheduling unrelated parallel machines
Two-dimensional packing with conflicts
NP-Complete operations research problems and approximation algorithms
Richard Bellman's contributions to computer science
A unified approach to truthful scheduling on related machines
Graph balancing: a special case of scheduling unrelated parallel machines
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
An optimal rounding gives a better approximation for scheduling unrelated machines
Semi-online scheduling with known maximum job size on two uniform machines
A linear compound algorithm for uniform machine scheduling
Exact and approximate algorithms for high-multiplicity parallel machine scheduling
Optimal collusion-resistant mechanisms with verification
Robust scheduling with budgeted uncertainty
Iterated greedy local search methods for unrelated parallel machine scheduling
On the configuration-LP for scheduling on unrelated machines
GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
Real-time scheduling with resource sharing on heterogeneous multiprocessors
Task scheduling with precedence constraints to minimize the total completion time
Title not available (Why is that?)
Worst-case analysis of a scheduling algorithm
Parallel machine scheduling with job assignment restrictions
Power of preemption for minimizing total completion time on uniform parallel machines
Unrelated parallel machine scheduling using local search
A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
Exact and approximation algorithms for makespan minimization on unrelated parallel machines
Unrelated parallel machine scheduling -- perspectives and progress
Multipurpose machine scheduling with rejection and identical job processing times
On the optimality of exact and approximation algorithms for scheduling problems
Parallel approximation schemes for subset sum and knapsack problems
Setting lower bounds on truthfulness
Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
A cutting plane algorithm for the unrelated parallel machine scheduling problem
Structure and complexity of extreme Nash equilibria
SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
Improving the complexities of approximation algorithms for optimization problems
Performance of service policies in a specialized service system with parallel servers
Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation
\(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems
Min-max cover of a graph with a small number of parts
Solving min-max shortest-path problems on a network
Off-line temporary tasks assignment.
Mixed coordination mechanisms for scheduling games on hierarchical machines
Approximation scheduling algorithms: a survey
Exact makespan minimization of unrelated parallel machines
Approximation algorithms for job scheduling with block-type conflict graphs
Implementation of optimal schedules in outsourcing with identical suppliers
Approximate strong equilibria in job scheduling games with two uniformly related machines
Performance guarantees of local search for minsum scheduling problems
Two approximation schemes for scheduling on parallel machines under a grade of service provision
Non-preemptive scheduling on machines with setup times
An EPTAS for scheduling on unrelated machines of few different types
A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis
Restricted assignment scheduling with resource constraints
On maximal and minimal triangular planar graphs: an optimization approach
Improved optimal algorithms for scheduling unit-length independent tasks on uniform machines
Greed works -- online algorithms for unrelated machine stochastic scheduling
Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints
A full description of polytopes related to the index of the lowest nonzero row of an assignment matrix
Heuristics and augmented neural networks for task scheduling with non-identical machines
Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
Complete formulations of polytopes related to extensions of assignment matrices
Bin stretching with migration on two hierarchical machines
A PTAS for scheduling unrelated machines of few different types
Streaming algorithms for multitasking scheduling with shared processing
Structural parameters for scheduling with assignment restrictions
Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories
Dividing splittable goods evenly and with limited fragmentation
Dividing splittable goods evenly and with limited fragmentation
Fair by design: multidimensional envy-free mechanisms

This page was built for publication: Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4095869)