Minimising Waiting Time Variance in the Single Machine Problem
From MaRDI portal
(Redirected from Publication:4136913)
Cited in
(64)- A V-shape property of optimal schedule of jobs about a common due date
- Survey of scheduling research involving due date determination decisions
- Mimimization of agreeably weighted variance in single machine systems
- Proof of a conjecture of Schrage about the completion time variance problem
- Single machine scheduling with coefficient of variation minimization
- 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
- 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
- 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
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Completion time variance minimization on a single machine is difficult
- A solvable case of the variance minimization problem
- The stochastic single machine scheduling problem with earliness and tardiness costs
- A quadratic integer programming method for minimizing the mean squared deviation of completion times
- Single machine \(\text{MAD}/T_{\max}\) problem with a common due date
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling
- \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions
- Multi-machine scheduling with variance minimization
- A branch and bound algorithm to minimize completion time variance on a single processor.
- Fast fully polynomial approximation schemes for minimizing completion time variance
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
- Completion time variance minimisation on two identical parallel processors
- Another well-solvable case of the QAP: maximizing the job completion time variance
- An efficient local search for minimizing completion time variance in permutation flow shops
- Minimizing completion time variance with compressible processing times
- New results on the completion time variance minimization
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
- Heuristic methods and applications: A categorized survey
- Processing-plus-wait due dates in single-machine scheduling
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- A branch and price algorithm for single-machine completion time variance
- An almost exact solution to the min completion time variance in a single machine
- A unified weight formula for calculating the sample variance from weighted successive differences
- An exact algorithm to minimize mean squared deviation of job completion times about a common due date
- Scheduling with monotonous earliness and tardiness penalties
- Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
- Stochastic single machine scheduling subject to machines breakdowns with quadratic early-tardy penalties for the preemptive-repeat model
- Hierarchical minimization of completion time variance and makespan in jobshops
- A branch and bound procedure to minimize mean absolute lateness on a single processor
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- A single-machine deteriorating job scheduling problem with a non-regular criterion
- Design of predictable production scheduling model using control theoretic approach
- Sequencing heuristic for bicriteria scheduling in a single machine problem
- Optimal sequencing of a set of positive numbers with the variance of the sequence's partial sums maximized
- Scheduling problems with random processing times under expected earliness/tardiness costs
- The multiple checkpoint ordering problem
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
- 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
- Minimizing mean squared deviation of completion times with maximum tardiness constraint
- 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
- Time-flexible min completion time variance in a single machine by quadratic programming
- A lower bound for weighted completion time variance
- Completion time variance minimization in single machine and multi-machine systems
- Single machine scheduling problems with controllable processing times and total absolute differences penalties
- Job scheduling methods for reducing waiting time variance
- Scheduling about a common due date with earliness and tardiness penalties
- Single machine stochastic JIT scheduling problem subject to machine breakdowns
- Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties
This page was built for publication: Minimising Waiting Time Variance in the Single Machine Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136913)
