Approximation algorithms for multiprocessor scheduling under uncertainty
type: Item
instance of: scholarly article
title: Approximation algorithms for multiprocessor scheduling under uncertainty
zbMATH Open document ID: 1213.68151
author: Guolong Lin
author: Rajmohan Rajaraman
published in: Theory of Computing Systems
publication date: 2010-12-17T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5827615
zbMATH Keywords: approximation algorithms
zbMATH Keywords: multiprocessor scheduling
describes a project that uses: JOBSHOP
MaRDI profile type: MaRDI publication profile
full work available at URL: s00224-010-9250-2
OpenAlex ID: W2685896946
cites work: A Computational Study of the Job-Shop Scheduling Problem
cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
cites work: Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
cites work: Introduction to algorithms
cites work: Q3292914
cites work: Q4198056
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: Project scheduling under uncertainty: survey and research potentials
cites work: On the Distribution of the Number of Successes in Independent Trials
cites work: Allocating Bandwidth for Bursty Connections
cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Q3525911
cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs
cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs
cites work: Chernoff–Hoeffding Bounds for Applications with Limited Independence
cites work: Q3818127
cites work: Improved Approximation Algorithms for Shop Scheduling Problems
cites work: Convex quadratic and semidefinite programming relaxations in scheduling
cites work: Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
DOI: 10.1007/S00224-010-9250-2
Recommended article: Implementation and experiments with an algorithm for parallel scheduling of complex dags under uncertainty (extended abstract)
Recommended article: Scheduling independent multiprocessor tasks
Recommended article: Q4536419
Recommended article: Q3024769
description: scientific article; zbMATH DE number 5827615