Mimimization of agreeably weighted variance in single machine systems

DOI10.1016/0377-2217(93)E0367-7zbMATH Open0912.90172OpenAlexW2118698671MaRDI QIDQ1127158FDOQ1127158

Authors: S. H. Smith 

Publication date: 5 November 1998

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

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0367-7

Recommendations

• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Minimizing weighted mean absolute deviation of flow times in single machine systems
• Multi-machine scheduling with variance minimization
• New results on the completion time variance minimization

zbMATH Keywords

due date assignmentvariance minimizationoptimal job sequencefully polynomial approximation schemesjob-dependent weights

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Survey of scheduling research involving due date determination decisions
• Sequencing with Earliness and Tardiness Penalties: A Review
• Completion time variance minimization on a single machine is difficult
• A Generalized Model of Optimal Due-Date Assignment by Linear Programming
• Title not available (Why is that?)
• Variance Minimization in Single Machine Sequencing Problems
• Proof of a conjecture of Schrage about the completion time variance problem
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Minimizing the Flow-time Variance in Single-machine Systems
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Minimizing Variation of Flow Time in Single Machine Systems
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Minimizing flow time variance in a single machine system using genetic algorithms
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• An algorithm for the CON due-date determination and sequencing problem
• Determination of an optimal common due date and optimal sequence in a single machine job shop
• A solvable case of the variance minimization problem
• Title not available (Why is that?)

Cited In (22)

• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• The single machine weighted mean squared deviation problem
• A single-machine deteriorating job scheduling problem with a non-regular criterion
• Minimizing weighted mean absolute deviation of job completion times from their weighted mean
• A half-product based approximation scheme for agreeably weighted completion time variance
• A tight lower bound for the completion time variance problem
• On the flexibility of a decision theory-based heuristic for single machine scheduling
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Minimization of ordered, symmetric half-products
• New results on the completion time variance minimization
• Fast fully polynomial approximation schemes for minimizing completion time variance
• The symmetric quadratic knapsack problem: approximation and scheduling applications
• Minimizing completion time variance with compressible processing times
• A lower bound for weighted completion time variance
• Multi-machine scheduling with variance minimization
• A lower bound for minimizing the total completion time of a three-agent scheduling problem
• \(V\)-shape property for job sequences that minimize the expected completion time variance
• Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
• Completion time variance minimization on a single machine is difficult
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
• Deterministic and Random Single Machine Sequencing with Variance Minimization
• Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection

This page was built for publication: Mimimization of agreeably weighted variance in single machine systems

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