The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
type: Item
instance of: scholarly article
title: The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
zbMATH Open document ID: 1408.90125
author: Leah Epstein
author: Asaf Levin
published in: Operations Research Letters
publication date: 2019-01-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 7002348
zbMATH Keywords: scheduling
zbMATH Keywords: preemptive schedule
zbMATH Keywords: release dates
zbMATH Keywords: power of preemption
MaRDI profile type: Publication
full work available at URL: j.orl.2016.09.013
OpenAlex ID: W2529680039
cites work: Approximation techniques for average completion time scheduling
cites work: The power of preemption on unrelated machines and applications to scheduling orders
cites work: Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines
cites work: Single parameter analysis of power of preemption on two and three uniform machines
cites work: A tight lower bound for the best-\(\alpha\) algorithm
cites work: A comment on scheduling on uniform machines under chain-type precedence constraints
DOI: 10.1016/J.ORL.2016.09.013
Recommended article: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine
Recommended article: Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity
Recommended article: Preemption in single machine earliness/tardiness scheduling
Recommended article: Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
Recommended article: Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
Recommended article: Single-machine scheduling with fixed periodic preventive maintenance to minimise the total weighted completion times
Recommended article: Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
Recommended article: Optimal assignment of due-dates for preemptive single-machine scheduling
Recommended article: Single machine scheduling to minimize total weighted tardiness
Recommended article: A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time
description: scientific article; zbMATH DE number 7002348