Mimimization of agreeably weighted variance in single machine systems
From MaRDI portal
Publication:1127158
DOI10.1016/0377-2217(93)E0367-7zbMath0912.90172OpenAlexW2118698671MaRDI QIDQ1127158
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
variance minimizationdue date assignmentoptimal job sequencefully polynomial approximation schemesjob-dependent weights
Related Items
On the flexibility of a decision theory-based heuristic for single machine scheduling, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, A lower bound for minimizing the total completion time of a three-agent scheduling problem, A lower bound for weighted completion time variance, Multi-machine scheduling with variance minimization, The symmetric quadratic knapsack problem: approximation and scheduling applications, A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION, The single machine weighted mean squared deviation problem, Minimization of ordered, symmetric half-products, 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, Minimizing completion time variance with compressible processing times, New results on the completion time variance minimization, A tight lower bound for the completion time variance 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, Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, Fast fully polynomial approximation schemes for minimizing completion time variance, A survey of the state-of-the-art of common due date assignment and scheduling research, Completion time variance minimization on a single machine is difficult
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for the CON due-date determination and sequencing problem
- Survey of scheduling research involving due date determination decisions
- Proof of a conjecture of Schrage about the completion time variance problem
- Minimizing flow time variance in a single machine system using genetic algorithms
- Completion time variance minimization on a single machine is difficult
- A solvable case of the variance minimization problem
- Sequencing with Earliness and Tardiness Penalties: A Review
- A Generalized Model of Optimal Due-Date Assignment by Linear Programming
- Determination of an optimal common due date and optimal sequence in a single machine job shop
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- 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
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- 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
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Variance Minimization in Single Machine Sequencing Problems
