Optimal preemptive scheduling on uniform machines with discounted flowtime objectives

DOI10.1016/j.ejor.2005.09.039zbMath1110.90040OpenAlexW2071879868MaRDI QIDQ856258

Dimitrios G. Pandelis

Publication date: 7 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.039

zbMATH Keywords

schedulinguniform machinesdiscounted flowtime

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Preemptive scheduling of two uniform parallel machines to minimize total tardiness

Cites Work

• Unnamed Item
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• A Level Algorithm for Preemptive Scheduling
• Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis