scientific article; zbMATH DE number 2119733

zbMATH Open1093.68552MaRDI QIDQ4829007FDOQ4829007

Authors: April Rasala, Patchrawat Uthaisombut, Clifford Stein, Eric Torng 

Publication date: 29 November 2004

Title of this publication is not available (Why is that?)

Recommendations

• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• Note: Bicriteria scheduling for minimizing flow time and maximum tardiness
• scientific article; zbMATH DE number 52239
• An improved lower bound for a bi-criteria scheduling problem
• Bicriteria scheduling with double due dates to minimize the maximum lateness

Mathematics Subject Classification ID

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

Cited In (14)

• Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
• Maximizing set function formulation of two scheduling problems
• Approximation algorithms for the bi-criteria weighted MAX-CUT problem
• An improved lower bound for a bi-criteria scheduling problem
• Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
• Bicriteria approximation algorithms for scheduling problems with communications delays
• Generalization of EDF and LLF: Identifying all optimal online algorithms for minimizing maximum lateness
• A note on scheduling to meet two min-sum objectives
• Two dimensional load balancing
• The constrained minimum weighted sum of job completion times problem
• Trading off worst and expected cost in decision tree problems
• A new approach for bicriteria partitioning problem
• Bi-objective matchings with the triangle inequality
• An almost tight lower bound for the scheduling problem to meet two min-sum objectives

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4829007)