Minimizing mean absolute deviation of completion times about a common due date
From MaRDI portal
Recommendations
- Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing the average deviation of job completion times about a common due date
- Minimizing the maximum deviation of job completion time about a common due-date
- Minimization of total absolute deviation for a common due date
- Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
- Minimizing the average deviation of job completion times about a common due-date: An extension
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Scheduling about a given common due date to minimize mean squared deviation of completion times
- scientific article; zbMATH DE number 4003886
- scientific article; zbMATH DE number 1559454
Cited in
(78)- An alternative proof of optimality for the common due-date assignment problem
- Survey of scheduling research involving due date determination decisions
- V-shape property of optimal sequence of jobs about a common due date on a single machine
- A fixed interval due-date scheduling problem with earliness and due-date costs
- Equivalence of mean flow time problems and mean absolute deviation problems
- Scheduling around a small common due date
- Scheduling to minimize weighted earliness and tardiness about a common due-date
- Single machine scheduling with coefficient of variation minimization
- V-shape property for optimal schedules with monotone penalty functions
- On the general solution for a class of early/tardy problems
- Common due date scheduling problem with separate earliness and tardiness penalties
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Scheduling about a given common due date to minimize mean squared deviation of completion times
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems
- A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
- The stochastic single machine scheduling problem with earliness and tardiness costs
- Genetic search with dynamic operating disciplines
- Single machine \(\text{MAD}/T_{\max}\) problem with a common due date
- A survey of the state-of-the-art of common due date assignment and scheduling research
- On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
- Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval
- Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem
- Single machine earliness-tardiness scheduling with resource-dependent release dates
- Simultaneous minimization of total completion time and total deviation of job completion times
- A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
- Machine scheduling with earliness, tardiness and non-execution penalties
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
- Processing-plus-wait due dates in single-machine scheduling
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem
- An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
- A branch and bound approach for single machine scheduling with earliness and tardiness penalties
- Algorithms for a class of single-machine weighted tardiness and earliness problems
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability
- An exact algorithm to minimize mean squared deviation of job completion times about a common due date
- Scheduling with monotonous earliness and tardiness penalties
- Job sequencing and due date assignment in a single machine shop with uncertain processing times
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine
- Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
- Multicriteria scheduling
- Minimizing flowtime and missed due-dates in single-machine sequencing
- Multicriteria scheduling problems: a survey
- Permutation flow shop scheduling with earliness and tardiness penalties
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Minimizing the average deviation of job completion times about a common due date
- Mean completion time for a randomly varying rate of work
- BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment
- Single- and multiple-processor models for minimizing completion time variance
- On Optimal Common Due-Date Determination
- Determination of an optimal common due date and optimal sequence in a single machine job shop
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- Optimal scheduling of jobs about a common due date on a single machine
- Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times
- Minimization of Total Absolute Flow Time Deviation in Single and Multiple Machine Scheduling
- A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
- scientific article; zbMATH DE number 1559454 (Why is no real title available?)
- Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date
- A note on mean absolute deviation
- Minimizing weighted mean absolute deviation of job completion times from their weighted mean
- A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden
- Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date
- Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date
- Single machine weighted earliness-tardiness penalty problem with a common due date
- Self-adaptive biased differential evolution for scheduling against common due dates
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Optimal due date assignment in multi-machine scheduling environments
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- Two due date assignment problems in scheduling a single machine
- A comparison of lower bounds for the single-machine early/tardy problem
- CON due-date determination and sequencing
- Scheduling about a common due date with earliness and tardiness penalties
- Dynamic programming approach to the single-machine sequencing problem with different due-dates
- Parametric precedence relations in single machine scheduling
- A differential evolution approach for the common due date early/tardy job scheduling problem
- Scheduling jobs on a machine subject to stochastic breakdowns to minimize absolute early-tardy penalties
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
- Optimal due date assignment and resource allocation in a group technology scheduling environment
This page was built for publication: Minimizing mean absolute deviation of completion times about a common due date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735428)
