An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
type: Item
instance of: scholarly article
title: An \(O(n \log n)\) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
zbMATH Open document ID: 0704.68052
DOI: 10.1016/0020-0190(90)90166-U
author: Yahui Zhu
author: Mohan L. Ahuja
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68M01
zbMATH DE Number: 4155890
zbMATH Keywords: preemptive scheduling
zbMATH Keywords: hypercube
zbMATH Keywords: balanced search tree
MaRDI profile type: Publication
cites work: Preemptive scheduling of independent jobs on a hypercube
cites work: Q4195901
cites work: Preemptive Scheduling with Due Dates
description: scientific article; zbMATH DE number 4155890