On the Minimization of the Makespan Subject to Flowtime Optimality

DOI10.1287/OPRE.41.4.797zbMath0782.90051OpenAlexW2168638012MaRDI QIDQ4272903

Brian Thomas Eck, Michael L. Pinedo

Publication date: 28 February 1994

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.41.4.797

zbMATH Keywords

heuristicsflowtimemakespanidentical machines in parallelworst- case bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Makespan minimization subject to flowtime optimality on identical parallel machines ⋮ Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime ⋮ Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations ⋮ Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan ⋮ Notes on a hierarchical scheduling problem on identical machines ⋮ Scheduling with bully selfish jobs ⋮ Minimizing makespan subject to minimum flowtime on two identical parallel machines ⋮ Minimizing flowtime subject to optimal makespan on two identical parallel machines ⋮ Multicriteria scheduling ⋮ Minimizing makespan subject to minimum total flow-time on identical parallel machines ⋮ Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs ⋮ Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time

This page was built for publication: On the Minimization of the Makespan Subject to Flowtime Optimality