Makespan minimization subject to flowtime optimality on identical parallel machines

DOI10.1016/S0305-0548(03)00113-8zbMath1068.68036OpenAlexW2067209293MaRDI QIDQ1885968

Chien-Hung Lin, Ching-Jong Liao

Publication date: 12 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00113-8

zbMATH Keywords

Identical parallel machinesBicriteriaMakespan minimizationTotal flowtime minimization

Mathematics Subject Classification ID

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

Related Items (4)

Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime ⋮ Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ Bicriteria multi-machine scheduling with equal processing times subject to release dates ⋮ Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple and bicriteria scheduling: A literature survey
• Algorithms minimizing mean flow time: Schedule-length properties
• Minimizing makespan subject to minimum total flow-time on identical parallel machines
• Multicriteria scheduling problems: a survey
• Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines
• On the Minimization of the Makespan Subject to Flowtime Optimality
• Minimizing makespan subject to minimum flowtime on two identical parallel machines

This page was built for publication: Makespan minimization subject to flowtime optimality on identical parallel machines