Scheduling with uncertainties on new computing platforms
type: Item
instance of: scholarly article
title: Scheduling with uncertainties on new computing platforms
zbMATH Open document ID: 1219.90066
author: Amine Mahjoub
author: Johnatan E. Pecero Sánchez
author: Denis Trystram
published in: Computational Optimization and Applications
publication date: 2011-05-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5886878
zbMATH Keywords: optimization
zbMATH Keywords: heuristics
zbMATH Keywords: uncertainties
zbMATH Keywords: stability
zbMATH Keywords: scheduling
zbMATH Keywords: grid computing
MaRDI profile type: Publication
full work available at URL: s10589-009-9311-0
OpenAlex ID: W2007590957
cites work: On the complexity of a class of combinatorial optimization problems with uncertainty
cites work: A Priori Optimization
cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
cites work: Q4433889
cites work: Q4692508
cites work: Scheduling Precedence Task Graphs with Disturbances
cites work: Sensitivity analysis for scheduling problems
cites work: Project scheduling under uncertainty: survey and research potentials
cites work: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
cites work: Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
cites work: Robust discrete optimization and its applications
cites work: Complexity of minimizing the total flow time with interval data and minmax regret criterion
cites work: A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
cites work: Towards an Architecture-Independent Analysis of Parallel Algorithms
cites work: Sensitivity analysis of scheduling algorithms
cites work: UET scheduling with unit interprocessor communication delays
cites work: Q3994933
cites work: Dynamic scheduling on parallel machines
cites work: NP-complete scheduling problems
cites work: Random orders
cites work: On the robust shortest path problem.
DOI: 10.1007/S10589-009-9311-0
description: scientific article; zbMATH DE number 5886878