Minimizing the Time-in-System Variance for a Finite Jobset
From MaRDI portal
Publication:4058801
DOI10.1287/mnsc.21.5.540zbMath0302.90021OpenAlexW1992391485MaRDI QIDQ4058801
Publication date: 1975
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.21.5.540
Integer programming (90C10) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
The stochastic single machine scheduling problem with earliness and tardiness costs, Scheduling with monotonous earliness and tardiness penalties, 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, 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, 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, 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, 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 SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION, Another well-solvable case of the QAP: maximizing the job completion time variance, 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, On the general solution for a class of early/tardy problems, A branch and price algorithm for single-machine completion time variance, An efficient local search for minimizing completion time variance in permutation flow shops, Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties, Tabu search for a class of single-machine scheduling problems, 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, 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, Minimizing flow time variance in a single machine system using genetic algorithms, Fast fully polynomial approximation schemes for minimizing completion time variance, 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
