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.034MaRDI QIDQ391787zbMATH OpenOpenAlexFDO

Authors Long Wan, Ran Ma, Jinjiang Yuan

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 schedulingidentical machinestotal completion timeworst-case ratio

Mathematics Subject Classification ID

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

Recommendations

• Equal processing time bicriteria scheduling on parallel machines
• Note: Bicriteria scheduling for minimizing flow time and maximum tardiness
• Notes on a hierarchical scheduling problem on identical machines
• Scheduling to minimize the maximum total completion time per machine
• Scheduling a single machine with primary and secondary objectives

Cites work

• A note on a scheduling problem with dual criteria
• A note on the extension of a result on scheduling with secondary criteria
• Complexity of single machine, multi-criteria scheduling problems
• How good are SPT schedules for fair optimality criteria
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimizing Schedule Length Subject to Minimum Flow Time
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Multicriteria scheduling
• Preemptive scheduling with two minimax criteria
• Scheduling algorithms
• Scheduling to minimize the maximum total completion time per machine
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

Cited in

(5)

• Equal processing time bicriteria scheduling on parallel machines
• Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
• Notes on a hierarchical scheduling problem on identical machines
• Single-machine primary-secondary scheduling with total tardiness being the primary criterion
• Scheduling to minimize the maximum total completion time per machine

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

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