Approximation results for a bicriteria job scheduling problem on a single machine without preemption

DOI10.1016/j.ipl.2004.12.007zbMath1182.68360OpenAlexW2045000969MaRDI QIDQ1041716

Eric Angel, Laurent Gourvès, Evripidis Bampis

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.12.007

zbMATH Keywords

single machine schedulingapproximation algorithmsbicriteria optimizationapproximate Pareto curve

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (4)

Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ A state-of-the-art survey on multi-scenario scheduling ⋮ A bi-criteria optimization model for medical device sterilization ⋮ An approximation scheme for the bi-scenario sum of completion times trade-off problem

Cites Work

• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• Linear probing and graphs
• Multicriteria scheduling problems: a survey
• Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• The constrained minimum spanning tree problem

This page was built for publication: Approximation results for a bicriteria job scheduling problem on a single machine without preemption