Robust scheduling of metaprograms
type: Item
instance of: scholarly article
title: Robust scheduling of metaprograms
zbMATH Open document ID: 1015.90032
published in: Journal of Scheduling
publication date: 2002-12-17T00:00:00Z
full work available at URL: https://docs.lib.purdue.edu/cstech/1395
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1847201
zbMATH Keywords: scheduling robustness
zbMATH Keywords: resource reservation
author: Ladislau Bölöni
author: Dan C. Marinescu
MaRDI profile type: Publication
OpenAlex ID: W2147049870
cites work: Q4003376
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Q3994933
cites work: Q4208619
DOI: 10.1002/JOS.115
Recommended article: Q5322699
Recommended article: Robust algorithms for preemptive scheduling
Recommended article: Robust Algorithms for Preemptive Scheduling
Recommended article: Scheduling of a meta-task with qos requirements in heterogeneous computing systems
Recommended article: Metaheuristics for scheduling in distributed computing environments
Recommended article: Meta-heuristics for stable scheduling on a single machine
Recommended article: Q4558005
Recommended article: Robust scheduling for flexible processing networks
Recommended article: Robust scheduling in an advanced planning and scheduling environment
description: scientific article; zbMATH DE number 1847201