Preemptive scheduling on identical parallel machines subject to deadlines.
type: Item
instance of: scholarly article
title: Preemptive scheduling on identical parallel machines subject to deadlines.
zbMATH Open document ID: 1037.90021
DOI: 10.1016/S0377-2217(02)00374-0
published in: European Journal of Operational Research
publication date: 2003-06-09T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1924657
zbMATH Keywords: Preemptive scheduling
zbMATH Keywords: Parallel machines
zbMATH Keywords: Total completion time
author: Meral Azizoğlu
MaRDI profile type: Publication
cites work: Q4396949
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Q4658190
cites work: Minimizing mean flow time with release time constraint
cites work: Q4198056
cites work: Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
cites work: Q4055377
cites work: Preemptive scheduling to minimize mean weighted flow time
full work available at URL: s0377-2217(02)00374-0
OpenAlex ID: W2023013850
Recommended article: Preemptive scheduling with deadlines on parallel machines
Recommended article: Optimal preemptive scheduling on a fixed number of identical parallel machines
Recommended article: Preemptive Scheduling of Parallel Jobs on Multiprocessors
Recommended article: Q4875180
Recommended article: Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
Recommended article: Algorithms – ESA 2005
Recommended article: PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
Recommended article: Scheduling preemptive jobs with precedence constraints on parallel machines
Recommended article: Preemptive and non-preemptive scheduling on two unrelated parallel machines
description: scientific article; zbMATH DE number 1924657