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