Minimizing mean absolute deviation of completion times about a common due date
From MaRDI portal
Publication:3735428
DOI10.1002/nav.3800330206zbMath0599.90049OpenAlexW2028376777MaRDI QIDQ3735428
Robert S. Sullivan, Yih-Long Chang, Uttarayan Bagchi
Publication date: 1986
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800330206
common due datemean absolute deviation of job completion timesmultiple optimal schedulesone machine scheduling problemtwo parallel machines mean flow time problem
Related Items (64)
Simultaneous minimization of total completion time and total deviation of job completion times ⋮ The stochastic single machine scheduling problem with earliness and tardiness costs ⋮ Scheduling with monotonous earliness and tardiness penalties ⋮ A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time ⋮ Optimal due date assignment in multi-machine scheduling environments ⋮ Machine scheduling with earliness, tardiness and non-execution penalties ⋮ Genetic search with dynamic operating disciplines ⋮ 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 ⋮ Single machine \(\text{MAD}/T_{\max}\) problem with a common due date ⋮ Optimal scheduling of jobs about a common due date on a single machine ⋮ Job sequencing and due date assignment in a single machine shop with uncertain processing times ⋮ Minimizing flowtime and missed due-dates in single-machine sequencing ⋮ Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach ⋮ An alternative proof of optimality for the common due-date assignment problem ⋮ An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Survey of scheduling research involving due date determination decisions ⋮ Two due date assignment problems in scheduling a single machine ⋮ A comparison of lower bounds for the single-machine early/tardy problem ⋮ 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 ⋮ Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine ⋮ CON due-date determination and sequencing ⋮ Scheduling about a common due date with earliness and tardiness penalties ⋮ Determination of an optimal common due date and optimal sequence in a single machine job shop ⋮ Dynamic programming approach to the single-machine sequencing problem with different due-dates ⋮ Parametric precedence relations in single machine scheduling ⋮ A branch and bound approach for single machine scheduling with earliness and tardiness penalties ⋮ Equivalence of mean flow time problems and mean absolute deviation problems ⋮ Due date assignments and scheduling a single machine with a general earliness/tardiness cost function ⋮ Scheduling around a small common due date ⋮ A differential evolution approach for the common due date early/tardy job scheduling problem ⋮ 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 ⋮ Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date ⋮ A note on mean absolute deviation ⋮ 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 ⋮ On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties ⋮ Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date ⋮ A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem ⋮ Single machine weighted earliness-tardiness penalty problem with a common due date ⋮ Multicriteria scheduling problems: a survey ⋮ Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments ⋮ Permutation flow shop scheduling with earliness and tardiness penalties ⋮ A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden ⋮ Algorithms for a class of single-machine weighted tardiness and earliness problems ⋮ Optimal due date assignment and resource allocation in a group technology scheduling environment ⋮ 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 common due date total earliness/tardiness scheduling with machine unavailability ⋮ BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS ⋮ 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 ⋮ Multicriteria scheduling ⋮ Single machine earliness-tardiness scheduling with resource-dependent release dates ⋮ Determination of fault-tolerant fabric-cutting schedules in a just-in-time apparel manufacturing environment ⋮ 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 absolute deviation of completion times about a common due date
