Unrelated parallel machine scheduling -- perspectives and progress

DOI10.1007/s12597-011-0059-9zbMath1353.90064OpenAlexW2045067184MaRDI QIDQ505093

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

zbMATH Keywords

schedulingparallel machinesunrelated

Mathematics Subject Classification ID

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

Related Items (3)

A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem ⋮ ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors ⋮ Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling

Cites Work

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

This page was built for publication: Unrelated parallel machine scheduling -- perspectives and progress