Multi-machine scheduling with variance minimization

DOI10.1016/S0166-218X(98)00020-1MaRDI QIDQ1392562zbMATH OpenFDO

Authors Xiaoqiang Cai, T. C. Edwin Cheng

Publication date 28 July 1998

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

NP-completeidentical parallel machinescompletion time variance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• New results on the completion time variance minimization
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Single- and multiple-processor models for minimizing completion time variance
• Minimizing the Flow-time Variance in Single-machine Systems

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 486483 (Why is no real title available?)
• Completion time variance minimization on a single machine is difficult
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Mimimization of agreeably weighted variance in single machine systems
• Minimising Waiting Time Variance in the Single Machine Problem
• Minimizing Variation of Flow Time in Single Machine Systems
• Minimizing the Flow-time Variance in Single-machine Systems
• Minimizing the Time-in-System Variance for a Finite Jobset
• New results on the completion time variance minimization
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Proof of a conjecture of Schrage about the completion time variance problem
• Variance Minimization in Single Machine Sequencing Problems

Cited in

(14)

• scientific article; zbMATH DE number 1559454 (Why is no real title available?)
• Scheduling on machines with variable service rates
• Permutation polyhedra and minimisation of the variance of completion times on a single machine
• Hierarchical minimization of completion time variance and makespan in jobshops
• A branch and price algorithm for single-machine completion time variance
• Fast fully polynomial approximation schemes for minimizing completion time variance
• Completion time variance minimization in single machine and multi-machine systems
• Completion time variance minimisation on two identical parallel processors
• The minimization scheduling problem of sum of squares of the machine completion times on two identical parallel machines
• Single- and multiple-processor models for minimizing completion time variance
• Job scheduling methods for reducing waiting time variance
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Proof of a conjecture of Schrage about the completion time variance problem
• A note on minimizing the sum of squares of machine completion times on two identical parallel machines

This page was built for publication: Multi-machine scheduling with variance minimization

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