Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis

DOI10.1287/ijoc.7.1.63zbMath0822.90084OpenAlexW2000863312MaRDI QIDQ4835449

S. Thomas McCormick, Michael L. Pinedo

Publication date: 9 October 1995

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.7.1.63

zbMATH Keywords

schedulingprecedence constraintssensitivity resultsfixed makespan deadlineminimum flowtime

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Optimal preemptive scheduling on uniform machines with discounted flowtime objectives ⋮ On the existence of schedules that are near-optimal for both makespan and total weighted completion time ⋮ Generating outpatient chemotherapy appointment templates with balanced flowtime and makespan ⋮ Best compromise solution for a new multiobjective scheduling problem ⋮ Multicriteria scheduling problems: a survey ⋮ The constrained minimum weighted sum of job completion times problem ⋮ Two-agent scheduling on uniform parallel machines with min-max criteria ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Multicriteria scheduling