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

DOI10.1287/IJOC.7.1.63MaRDI QIDQ4835449zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Optimal preemptive scheduling on uniform machines with discounted flowtime objectives
• Preemptive scheduling on uniform machines to minimize mean flow time
• On the Minimization of the Makespan Subject to Flowtime Optimality
• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• Minimizing Schedule Length Subject to Minimum Flow Time

Cited in

(10)

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

This page was built for publication: Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis

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