Unrelated parallel machine scheduling -- perspectives and progress

DOI10.1007/S12597-011-0059-9zbMATH Open1353.90064OpenAlexW2045067184MaRDI QIDQ505093FDOQ505093

Authors: Suresh Kamath 

Publication date: 19 January 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-011-0059-9

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

zbMATH Keywords

schedulingparallel machinesunrelated

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10)

Cites Work

• Optimization by simulated annealing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Future paths for integer programming and links to artificial intelligence
• Optimization, approximation, and complexity classes
• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Title not available (Why is that?)
• Proof verification and the hardness of approximation problems
• Probabilistic checking of proofs
• The complexity of theorem-proving procedures
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Title not available (Why is that?)
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Approximation algorithms for scheduling unrelated parallel machines
• ``Neural computation of decisions in optimization problems
• An Application of Bin-Packing to Multiprocessor Scheduling
• Title not available (Why is that?)
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Title not available (Why is that?)
• On the Computational Complexity of Combinatorial Problems
• Efficient coordination mechanisms for unrelated machine scheduling
• Distinguishing quantum operations having few Kraus operators
• Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
• Title not available (Why is that?)
• Algorithmic mechanism design (extended abstract)
• A lower bound for scheduling mechanisms
• Quantum mechanical Hamiltonian models of Turing 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
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• Duality-Based Algorithms for Scheduling Unrelated Parallel Machines
• Feature Article—Genetic Algorithms for the Operations Researcher
• Title not available (Why is that?)
• Scheduling Unrelated Machines by Randomized Rounding
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• What makes an optimization problem hard?.
• Approximation schemes for scheduling and covering on unrelated machines
• Setting lower bounds on truthfulness (extended abstract)
• Title not available (Why is that?)
• Convex programming for scheduling unrelated parallel machines
• Theoretical aspects of local search.
• An optimal rounding gives a better approximation for scheduling unrelated machines
• Simple explanation of the no-free-lunch theorem and its implications
• Title not available (Why is that?)
• Analysis of a linear programming heuristic for scheduling unrelated parallel machines
• Heuristics for scheduling unrelated parallel machines
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
• Title not available (Why is that?)
• An \(R||C_{\max}\) quantum scheduling algorithm
• Algorithms for Scheduling Tasks on Unrelated Processors
• TOOLS FOR QUANTUM ALGORITHMS
• Title not available (Why is that?)
• Title not available (Why is that?)
• An improved randomized truthful mechanism for scheduling unrelated machines
• Quantum optimization

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
• Title not available (Why is that?)
• 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)