An improved lower bound for a bi-criteria scheduling problem
type: Item
instance of: scholarly article
title: An improved lower bound for a bi-criteria scheduling problem
zbMATH Open document ID: 1138.90008
author: Jin Yan
published in: Operations Research Letters
publication date: 2008-05-29T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5280656
zbMATH Keywords: scheduling
zbMATH Keywords: completion time
zbMATH Keywords: weighted completion time
zbMATH Keywords: lower bound
MaRDI profile type: Publication
full work available at URL: j.orl.2007.03.003
OpenAlex ID: W2047252381
cites work: A note on scheduling to meet two min-sum objectives
cites work: Q4252370
cites work: Q3425494
cites work: On the existence of schedules that are near-optimal for both makespan and total weighted completion time
DOI: 10.1016/J.ORL.2007.03.003
description: scientific article; zbMATH DE number 5280656