Approximation results for a bicriteria job scheduling problem on a single machine without preemption
type: Item
instance of: scholarly article
title: Approximation results for a bicriteria job scheduling problem on a single machine without preemption
zbMATH Open document ID: 1182.68360
author: Eric Angel
author: Evripidis Bampis
author: Laurent Gourvès
published in: Information Processing Letters
publication date: 2009-12-04T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5642314
zbMATH Keywords: approximation algorithms
zbMATH Keywords: bicriteria optimization
zbMATH Keywords: single machine scheduling
zbMATH Keywords: approximate Pareto curve
MaRDI profile type: Publication
full work available at URL: j.ipl.2004.12.007
OpenAlex ID: W2045000969
cites work: Q4252370
cites work: Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: Q4002567
cites work: Linear probing and graphs
cites work: Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
cites work: The constrained minimum spanning tree problem
cites work: Multicriteria scheduling problems: a survey
DOI: 10.1016/J.IPL.2004.12.007
description: scientific article; zbMATH DE number 5642314