Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
type: Item
instance of: scholarly article
title: Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
zbMATH Open document ID: 0782.90050
DOI: 10.1016/0377-2217(93)90243-G
author: V. Reddy Dondeti
author: Hamilton Emmons
published in: European Journal of Operational Research
publication date: 1993-12-20T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 474845
zbMATH Keywords: fixed start and finish times
zbMATH Keywords: preemption of jobs
zbMATH Keywords: polynomial-time algorithms
zbMATH Keywords: minimal-cost preemptive solutions
zbMATH Keywords: transportation-network problem
zbMATH Keywords: cyclic scheduling
zbMATH Keywords: \(NP\)-completeness
MaRDI profile type: Publication
cites work: Scheduling jobs with fixed start and end times
cites work: Q4673630
cites work: When Is the Classroom Assignment Problem Hard?
cites work: Max-min matching problems with multiple assignments
cites work: Games of Boldness, Where the Player Performing the Hardest Task Wins
cites work: Q4198056
cites work: The Complexity of Coloring Circular Arcs and Chords
cites work: Minimal Resources for Fixed and Variable Job Schedules
cites work: An Optimal Solution for the Channel-Assignment Problem
cites work: On the computational complexity of (maximum) class scheduling
cites work: Q4130999
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q4739657
cites work: Coloring a Family of Circular Arcs
full work available at URL: 0377-2217(93)90243-g
OpenAlex ID: W2040843365
description: scientific article; zbMATH DE number 474845