Scheduling imprecise computation tasks with \(0/1\)-constraint
type: Item
instance of: scholarly article
title: Scheduling imprecise computation tasks with \(0/1\)-constraint
zbMATH Open document ID: 0890.68018
DOI: 10.1016/S0166-218X(97)00024-3
author: J. Ning
published in: Discrete Applied Mathematics
publication date: 1998-02-17T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 1109938
zbMATH Keywords: preemptively scheduling
zbMATH Keywords: imprecisely scheduled
MaRDI profile type: Publication
cites work: Q3680271
cites work: Minimizing mean weighted execution time loss on identical and uniform processors
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Some simple scheduling algorithms
cites work: Minimizing the weighted number of tardy task units
cites work: A fault-tolerant scheduling problem
cites work: Single Machine Scheduling to Minimize Total Late Work
cites work: Approximation algorithms for scheduling a single machine to minimize total late work
cites work: Algorithms for Scheduling Imprecise Computations with Timing Constraints
OpenAlex ID: W2063904016
description: scientific article; zbMATH DE number 1109938