Unrelated parallel machine scheduling -- perspectives and progress
From MaRDI portal
(Redirected from Publication:505093)
Recommendations
- scientific article; zbMATH DE number 1783886
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Approximation algorithms for scheduling unrelated parallel machines
- Improved approximation schemes for scheduling unrelated parallel machines
- Heuristics for scheduling unrelated parallel machines
Cites work
- scientific article; zbMATH DE number 1566497 (Why is no real title available?)
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 5764783 (Why is no real title available?)
- scientific article; zbMATH DE number 5764807 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1488569 (Why is no real title available?)
- scientific article; zbMATH DE number 1500651 (Why is no real title available?)
- scientific article; zbMATH DE number 4115948 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 1855680 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
- A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
- A lower bound for scheduling mechanisms
- Algorithmic mechanism design (extended abstract)
- Algorithms for Scheduling Tasks on Unrelated Processors
- An Application of Bin-Packing to Multiprocessor Scheduling
- An \(R||C_{\max}\) quantum scheduling algorithm
- An improved randomized truthful mechanism for scheduling unrelated machines
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation schemes for scheduling and covering on unrelated machines
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Convex programming for scheduling unrelated parallel machines
- Distinguishing quantum operations having few Kraus operators
- Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
- Efficient coordination mechanisms for unrelated machine scheduling
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Exact and approximation algorithms for makespan minimization on unrelated parallel machines
- Feature Article—Genetic Algorithms for the Operations Researcher
- Future paths for integer programming and links to artificial intelligence
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- Heuristics for scheduling unrelated parallel machines
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- On the Computational Complexity of Combinatorial Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimization by simulated annealing
- Optimization, approximation, and complexity classes
- Probabilistic checking of proofs
- Proof verification and the hardness of approximation problems
- Quantum mechanical Hamiltonian models of Turing machines
- Quantum optimization
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Scheduling Unrelated Machines by Randomized Rounding
- Setting lower bounds on truthfulness (extended abstract)
- Simple explanation of the no-free-lunch theorem and its implications
- TOOLS FOR QUANTUM ALGORITHMS
- The complexity of theorem-proving procedures
- Theoretical aspects of local search.
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- Unrelated parallel machine scheduling using local search
- What makes an optimization problem hard?.
- ``Neural computation of decisions in optimization problems
Cited in
(10)- A desired load distribution model for scheduling of unrelated parallel machines
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
- A note on unrelated parallel machine scheduling with time-dependent processing times
- scientific article; zbMATH DE number 605173 (Why is no real title available?)
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
- A unified approach to scheduling on unrelated parallel machines
- Convex programming for scheduling unrelated parallel machines
- A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem
- Scheduling unrelated parallel machines with optional machines and jobs selection
- Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines
This page was built for publication: Unrelated parallel machine scheduling -- perspectives and progress
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505093)
