Mimimization of agreeably weighted variance in single machine systems
From MaRDI portal
(Redirected from Publication:1127158)
Recommendations
Cites work
- scientific article; zbMATH DE number 31717 (Why is no real title available?)
- scientific article; zbMATH DE number 232395 (Why is no real title available?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A Generalized Model of Optimal Due-Date Assignment by Linear Programming
- A solvable case of the variance minimization problem
- An algorithm for the CON due-date determination and sequencing problem
- Completion time variance minimization on a single machine is difficult
- Determination of an optimal common due date and optimal sequence in a single machine job shop
- Deterministic and Random Single Machine Sequencing with Variance Minimization
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Minimising Waiting Time Variance in the Single Machine Problem
- Minimizing Variation of Flow Time in Single Machine Systems
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Minimizing flow time variance in a single machine system using genetic algorithms
- Minimizing the Flow-time Variance in Single-machine Systems
- Minimizing the Time-in-System Variance for a Finite Jobset
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Proof of a conjecture of Schrage about the completion time variance problem
- Sequencing with Earliness and Tardiness Penalties: A Review
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Survey of scheduling research involving due date determination decisions
- Variance Minimization in Single Machine Sequencing Problems
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
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
- Deterministic and Random Single Machine Sequencing with Variance Minimization
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)
