Variance Minimization in Single Machine Sequencing Problems
From MaRDI portal
Publication:5668251
DOI10.1287/mnsc.18.9.518zbMath0254.90040OpenAlexW2014321668MaRDI QIDQ5668251
Alan G. Merten, Mervin E. Muller
Publication date: 1972
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.18.9.518
Related Items
The stochastic single machine scheduling problem with earliness and tardiness costs, Scheduling with monotonous earliness and tardiness penalties, On the flexibility of a decision theory-based heuristic for single machine scheduling, A quadratic integer programming method for minimizing the mean squared deviation of completion times, Scheduling deteriorating jobs with a learning effect on unrelated parallel machines, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, Processing-plus-wait due dates in single-machine scheduling, Single machine \(\text{MAD}/T_{\max}\) problem with a common due date, Single machine scheduling problems with controllable processing times and total absolute differences penalties, Variability of completion time differences in permutation flow shop scheduling, Completion time variance minimisation on two identical parallel processors, 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, Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling, Job scheduling methods for reducing waiting time variance, Mimimization of agreeably weighted variance in single machine systems, A lower bound for weighted completion time variance, 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 about a common due date with earliness and tardiness penalties, A branch and bound algorithm to minimize completion time variance on a single processor., Proof of a conjecture of Schrage about the completion time variance problem, Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times, 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, Scheduling jobs on a single machine to maximize the total revenue of jobs, The single machine weighted mean squared deviation problem, Minimizing mean squared deviation of completion times with maximum tardiness constraint, Sequencing jobs on a single machine: A neural network approach, Single machine scheduling with coefficient of variation minimization, Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties, A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions, A branch and price algorithm for single-machine completion time variance, An efficient local search for minimizing completion time variance in permutation flow shops, Minimizing weighted mean absolute deviation of job completion times from their weighted mean, Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties, 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, Minimizing completion time variance with compressible processing times, Completion time variance minimization in single machine and multi-machine systems, New results on the completion time variance minimization, Scheduling about a given common due date to minimize mean squared deviation of completion times, A tight lower bound for the completion time variance problem, \(V\)-shape property for job sequences that minimize the expected completion time variance, Sequencing heuristic for bicriteria scheduling in a single machine problem, A branch and bound procedure to minimize mean absolute lateness on a single processor, 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, Minimizing flow time variance in a single machine system using genetic algorithms, 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, An exact algorithm to minimize mean squared deviation of job completion times about a common due date, A solvable case of the variance minimization problem
