Bounds for the position of the smallest job in completion time variance minimization

DOI10.1016/S0377-2217(98)00002-2zbMath0935.90014OpenAlexW2087418334WikidataQ127976795 ScholiaQ127976795MaRDI QIDQ1296376

V. Rajendra Prasad, D. K. Manna

Publication date: 2 August 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00002-2

zbMATH Keywords

single-machine schedulingheuristic procedurecompletion time variance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

On the flexibility of a decision theory-based heuristic for single machine scheduling, Completion time variance minimisation on two identical parallel processors, Job scheduling methods for reducing waiting time variance, A lower bound for weighted completion time variance, Time-flexible min completion time variance in a single machine by quadratic programming, A branch and bound algorithm to minimize completion time variance on a single processor., An almost exact solution to the min completion time variance in a single machine, A branch and price algorithm for single-machine completion time variance, Hierarchical minimization of completion time variance and makespan in jobshops, Completion time variance minimization in single machine and multi-machine systems, Sequencing heuristic for bicriteria scheduling in a single machine problem, Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection, Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests

Cites Work

• Scheduling about a common due date with earliness and tardiness penalties
• Proof of a conjecture of Schrage about the completion time variance problem
• A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions
• Minimizing flow time variance in a single machine system using genetic algorithms
• Completion time variance minimization on a single machine is difficult
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• New results on the completion time variance minimization
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing Variation of Flow Time in Single Machine Systems
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Minimizing the Flow-time Variance in Single-machine Systems
• Variance Minimization in Single Machine Sequencing Problems