Minimising Waiting Time Variance in the Single Machine Problem

DOI10.1287/mnsc.23.6.567zbMath0362.90051OpenAlexW2079916778MaRDI QIDQ4136913

I. G. Chowdhury, Samuel Eilon

Publication date: 1977

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.23.6.567

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25)

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, 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, Completion time variance minimisation on two identical parallel processors, Survey of scheduling research involving due date determination decisions, 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, \(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 about a common due date with earliness and tardiness penalties, A branch and bound algorithm to minimize completion time variance on a single processor., Single machine stochastic JIT scheduling problem subject to machine breakdowns, 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, Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties, 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, Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model, Minimizing mean squared deviation of completion times with maximum tardiness constraint, 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, 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, Tabu search for a class of single-machine scheduling problems, Hierarchical minimization of completion time variance and makespan in jobshops, Design of predictable production scheduling model using control theoretic approach, Minimizing completion time variance with compressible processing times, The Multiple Checkpoint Ordering Problem, Completion time variance minimization in single machine and multi-machine systems, New results on the completion time variance minimization, Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs, Scheduling about a given common due date to minimize mean squared deviation of completion times, \(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, Heuristic methods and applications: A categorized survey, A unified weight formula for calculating the sample variance from weighted successive differences, Sequencing heuristic for bicriteria scheduling in a single machine problem, A branch and bound procedure to minimize mean absolute lateness on a single processor, Scheduling problems with random processing times under expected earliness/tardiness costs, 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, Parallel machine scheduling to minimize costs for earliness and number of tardy jobs, Completion time variance minimization on a single machine is difficult, A V-shape property of optimal schedule of jobs about a common due date, 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