Completion time variance minimization on a single machine is difficult
From MaRDI portal
Publication:1317023
DOI10.1016/0167-6377(93)90019-DzbMath0794.90024OpenAlexW1993900332MaRDI QIDQ1317023
Publication date: 17 April 1994
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(93)90019-d
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Complexity of a class of nonlinear combinatorial problems related to their linear counterparts, Minimizing variation of production rates in just-in-time systems: A survey, Machine scheduling with earliness, tardiness and non-execution penalties, Scheduling deteriorating jobs with a learning effect on unrelated parallel machines, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs, Processing-plus-wait due dates in single-machine scheduling, A survey of scheduling with controllable processing times, Variability of completion time differences in permutation flow shop scheduling, Completion time variance minimisation on two identical parallel processors, Solving a stochastic single machine problem with initial idle time and quadratic objective, Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized, Pseudopolynomial algorithms for CTV minimization in single machine scheduling, Job scheduling methods for reducing waiting time variance, Mimimization of agreeably weighted variance in single machine systems, Total absolute deviation of job completion times on uniform and unrelated machines, A lower bound for weighted completion time variance, \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions, Multi-machine scheduling with variance minimization, The symmetric quadratic knapsack problem: approximation and scheduling applications, Time-flexible min completion time variance in a single machine by quadratic programming, Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties, Due date assignments and scheduling a single machine with a general earliness/tardiness cost function, An almost exact solution to the min completion time variance in a single machine, A note on lower bound for completion time variance in single machine scheduling., A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION, The single machine weighted mean squared deviation problem, Another well-solvable case of the QAP: maximizing the job completion time variance, A branch and price algorithm for single-machine completion time variance, An efficient local search for minimizing completion time variance in permutation flow shops, Minimization of ordered, symmetric half-products, Minimizing weighted mean absolute deviation of job completion times from their weighted mean, Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date, A half-product based approximation scheme for agreeably weighted completion time variance, Hierarchical minimization of completion time variance and makespan in jobshops, Minimizing completion time variance with compressible processing times, On the complexity of the single machine scheduling problem minimizing total weighted delay penalty, Algorithms for minclique scheduling problems, Completion time variance minimization in single machine and multi-machine systems, New results on the completion time variance minimization, A tight lower bound for the completion time variance problem, BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS, A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems, Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties, Sequencing heuristic for bicriteria scheduling in a single machine problem, Bounds for the position of the smallest job in completion time variance minimization, Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection, Using a hybrid evolutionary algorithm to minimize variance in response time for multimedia object requests, 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, An exact algorithm to minimize mean squared deviation of job completion times about a common due date
Cites Work
- Mimimization of agreeably weighted variance in single machine systems
- Proof of a conjecture of Schrage about the completion time variance problem
- New results on the completion time variance minimization
- Sequencing with Earliness and Tardiness Penalties: A Review
- 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
- 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
- Variance Minimization in Single Machine Sequencing Problems
