Completion time variance minimization on a single machine is difficult
From MaRDI portal
Publication:1317023
Recommendations
- A solvable case of the variance minimization problem
- Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
- A branch and bound algorithm to minimize completion time variance on a single processor.
- New results on the completion time variance minimization
- Complexity of a scheduling problem with controllable processing times
Cites work
- Deterministic and Random Single Machine Sequencing with Variance Minimization
- Mimimization of agreeably weighted variance in single machine systems
- Minimising Waiting Time Variance in the Single Machine Problem
- Minimizing Variation of Flow Time in Single Machine Systems
- Minimizing the Time-in-System Variance for a Finite Jobset
- New results on the completion time variance minimization
- 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
- Variance Minimization in Single Machine Sequencing Problems
Cited in
(52)- Minimizing completion time variance with compressible processing times
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
- Minimising variance of job completion times in a single machine
- An exact algorithm to minimize mean squared deviation of job completion times about a common due date
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
- Bounds for the position of the smallest job in completion time variance minimization
- Multi-machine scheduling with variance minimization
- Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests
- Machine scheduling with earliness, tardiness and non-execution penalties
- A tight lower bound for the completion time variance problem
- Job scheduling methods for reducing waiting time variance
- Processing-plus-wait due dates in single-machine scheduling
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
- An efficient local search for minimizing completion time variance in permutation flow shops
- The single machine weighted mean squared deviation problem
- Mimimization of agreeably weighted variance in single machine systems
- Minimizing weighted mean absolute deviation of job completion times from their weighted mean
- Completion time variance minimisation on two identical parallel processors
- A half-product based approximation scheme for agreeably weighted completion time variance
- A lower bound for weighted completion time variance
- BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
- Hierarchical minimization of completion time variance and makespan in jobshops
- Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Sequencing heuristic for bicriteria scheduling in a single machine problem
- A branch and price algorithm for single-machine completion time variance
- A single-machine deteriorating job scheduling problem with a non-regular criterion
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Minimizing variation of production rates in just-in-time systems: A survey
- Algorithms for minclique scheduling problems
- Solving a stochastic single machine problem with initial idle time and quadratic objective
- A note on lower bound for completion time variance in single machine scheduling.
- An almost exact solution to the min completion time variance in a single machine
- Minimization of ordered, symmetric half-products
- Completion time variance minimization in single machine and multi-machine systems
- A survey of scheduling with controllable processing times
- \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions
- Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
- Another well-solvable case of the QAP: maximizing the job completion time variance
- Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
- Total absolute deviation of job completion times on uniform and unrelated machines
- Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Variability of completion time differences in permutation flow shop scheduling
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling
- New results on the completion time variance minimization
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
- Fast fully polynomial approximation schemes for minimizing completion time variance
- Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
- Time-flexible min completion time variance in a single machine by quadratic programming
This page was built for publication: Completion time variance minimization on a single machine is difficult
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317023)
