Optimal preemptive scheduling on uniform machines with discounted flowtime objectives

DOI10.1016/J.EJOR.2005.09.039zbMATH Open1110.90040OpenAlexW2071879868MaRDI QIDQ856258FDOQ856258

D. 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)

Cites Work

• Title not available (Why is that?)
• A Level Algorithm for Preemptive Scheduling
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis

Cited In (2)

• Scheduling n Independent Jobs on m Uniform Machines with both Flowtime and Makespan Objectives: A Parametric Analysis
• Preemptive scheduling of two uniform parallel machines to minimize total tardiness

   Recommendations

• Preemptive scheduling on uniform machines to minimize mean flow time 👍 👎
• Preemptive Scheduling of Stochastic Jobs with a Two-Stage Processing Time Distribution on M + 1 Parallel Machines 👍 👎
• Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs 👍 👎
• Title not available (Why is that?) 👍 👎
• Stochastic scheduling on parallel machines to minimize discounted holding costs 👍 👎

This page was built for publication: Optimal preemptive scheduling on uniform machines with discounted flowtime objectives

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