Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
From MaRDI portal
Publication:3777790
DOI10.1287/mnsc.33.7.894zbMath0636.90049OpenAlexW2019272707MaRDI QIDQ3777790
Uttarayan Bagchi, Yih-Long Chang, Robert S. Sullivan
Publication date: 1987
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.33.7.894
common due datemean squared deviationnonpreemptive single machine schedulingcompletion time variance problemzero ready time
Related Items (56)
Scheduling with monotonous earliness and tardiness penalties ⋮ Optimal due date assignment in multi-machine scheduling environments ⋮ A quadratic integer programming method for minimizing the mean squared deviation of completion times ⋮ Genetic search with dynamic operating disciplines ⋮ Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ Single machine \(\text{MAD}/T_{\max}\) problem with a common due date ⋮ A dual criteria sequencing problem with earliness and tardiness penalties ⋮ Variability of completion time differences in permutation flow shop scheduling ⋮ Completion time variance minimisation on two identical parallel processors ⋮ Survey of scheduling research involving due date determination decisions ⋮ Single machine scheduling with common due data assignment in a group technology environment ⋮ Two due date assignment problems in scheduling a single machine ⋮ Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ Pseudopolynomial algorithms for CTV minimization in single machine scheduling ⋮ A semi-infinite programming model for earliness/tardiness production planning with simulated annealing ⋮ Optimal sequences in stochastic single machine shops ⋮ A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm ⋮ 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 ⋮ The symmetric quadratic knapsack problem: approximation and scheduling applications ⋮ Equitable scheduling on a single machine ⋮ Scheduling about a common due date with earliness and tardiness penalties ⋮ Parametric precedence relations in single machine scheduling ⋮ A branch and bound approach for single machine scheduling with earliness and tardiness penalties ⋮ Single machine stochastic JIT scheduling problem subject to machine breakdowns ⋮ Due date assignments and scheduling a single machine with a general earliness/tardiness cost function ⋮ Scheduling to minimize weighted earliness and tardiness about a common due-date ⋮ Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties ⋮ Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model ⋮ The single machine weighted mean squared deviation problem ⋮ Minimizing mean squared deviation of completion times with maximum tardiness constraint ⋮ 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 ⋮ Common due date scheduling problem with separate earliness and tardiness penalties ⋮ An efficient local search for minimizing completion time variance in permutation flow shops ⋮ Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date ⋮ Multicriteria scheduling problems: a survey ⋮ Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments ⋮ A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden ⋮ Design of predictable production scheduling model using control theoretic approach ⋮ On the complexity of the single machine scheduling problem minimizing total weighted delay penalty ⋮ Optimal due date assignment and resource allocation in a group technology scheduling environment ⋮ 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 ⋮ Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method ⋮ A tight lower bound for the completion time variance problem ⋮ Single machine scheduling to minimize mean absolute lateness: A heuristic solution ⋮ 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 ⋮ Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment ⋮ 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 ⋮ 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
This page was built for publication: Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
