A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
type: Item
instance of: scholarly article
title: A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions
zbMATH Open document ID: 1167.90513
author: Yumei Huo
author: Joseph Y.-T. Leung
author: Xin Wang
published in: Discrete Optimization
publication date: 2009-08-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5596687
zbMATH Keywords: preemptive scheduling
zbMATH Keywords: release time
zbMATH Keywords: inclusive processing set
zbMATH Keywords: makespan minimization
zbMATH Keywords: polynomial-time algorithms
MaRDI profile type: Publication
full work available at URL: j.disopt.2009.02.002
OpenAlex ID: W2027808249
cites work: Parallel machine scheduling under a grade of service provision
cites work: Parallel machine scheduling with job assignment restrictions
cites work: Scheduling parallel machines with inclusive processing set restrictions
cites work: Scheduling with deadlines and loss functions
cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
cites work: Complexity of scheduling problems with multi-purpose machines
cites work: A new approach to the maximum-flow problem
cites work: Scheduling parallel machines with inclusive processing set restrictions and job release times
DOI: 10.1016/J.DISOPT.2009.02.002
description: scientific article; zbMATH DE number 5596687