Minimizing average completion time in the presence of release dates
type: Item
instance of: scholarly article
title: Minimizing average completion time in the presence of release dates
zbMATH Open document ID: 0920.90074
DOI: 10.1007/BF01585872
author: Clifford Stein
author: Cynthia Phillips
author: Joel Wein
published in: Mathematical Programming. Series A. Series B
publication date: 1999-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1294691
zbMATH Keywords: relaxations
zbMATH Keywords: average completion time
zbMATH Keywords: NP-hard
zbMATH Keywords: constant-factor approximation algorithms
zbMATH Keywords: parallel machine models
zbMATH Keywords: preemptive and nonpreemptive schedules
zbMATH Keywords: average weighted completion time
MaRDI profile type: Publication
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Q4818873
cites work: Q3619797
cites work: Minimizing mean flow time with release time constraint
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
cites work: Technical Note—Minimizing Average Flow Time with Parallel Machines
cites work: Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
cites work: Q4228496
cites work: Q3217922
cites work: Q4124328
cites work: Scheduling with deadlines and loss functions
cites work: Q3140446
cites work: Task Scheduling in Networks
cites work: Improved Approximation Algorithms for Shop Scheduling Problems
description: scientific article; zbMATH DE number 1294691