A quadratic integer programming method for minimizing the mean squared deviation of completion times

DOI10.1016/0167-6377(94)90079-5zbMath0814.90053OpenAlexW2015037427MaRDI QIDQ1342085

Michael X. Weng, José A. Ventura

Publication date: 11 January 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90079-5

zbMATH Keywords

common due datejob completion timesmean squared deviationLagrangian solution procedure

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Measures of balance in combinatorial optimization

Cites Work

• Unnamed Item
• Scheduling about a common due date with earliness and tardiness penalties
• Proof of a conjecture of Schrage about the completion time variance problem
• 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
• A note on ‘Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties’
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
• Validation of subgradient optimization
• Minimizing the Flow-time Variance in Single-machine Systems
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Variance Minimization in Single Machine Sequencing Problems
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: A quadratic integer programming method for minimizing the mean squared deviation of completion times