Multi-machine scheduling with variance minimization

DOI10.1016/S0166-218X(98)00020-1zbMath0908.90160MaRDI QIDQ1392562

Cheng, T. C. Edwin, Xiaoqiang Cai

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)

Related Items

Completion time variance minimisation on two identical parallel processors, A branch and price algorithm for single-machine completion time variance, Completion time variance minimization in single machine and multi-machine systems

Cites Work

• Unnamed Item
• Unnamed Item
• Mimimization of agreeably weighted variance in single machine systems
• Proof of a conjecture of Schrage about the completion time variance problem
• Completion time variance minimization on a single machine is difficult
• New results on the completion time variance minimization
• 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