Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines

DOI10.1016/J.TCS.2013.05.034zbMath1358.90050OpenAlexW2079725842MaRDI QIDQ391787

Jinjiang Yuan, Long Wan, Ran Ma

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.034

zbMATH Keywords

bicriteria schedulingworst-case ratiototal completion timeidentical machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Notes on a hierarchical scheduling problem on identical machines ⋮ Scheduling to minimize the maximum total completion time per machine

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling to minimize the maximum total completion time per machine
• How good are SPT schedules for fair optimality criteria
• Complexity of single machine, multi-criteria scheduling problems
• Preemptive scheduling with two minimax criteria
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Multicriteria scheduling
• Minimizing Schedule Length Subject to Minimum Flow Time
• A note on a scheduling problem with dual criteria
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• A note on the extension of a result on scheduling with secondary criteria

This page was built for publication: Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines