Minimizing weighted mean absolute deviation of job completion times from their weighted mean

DOI10.1016/J.AMC.2011.04.020MaRDI QIDQ548013zbMATH OpenOpenAlexFDO

Authors Erdal Erel, Jay B. Ghosh

Publication date 27 June 2011

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/21857

zbMATH Keywords

approximation schemedynamic programscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 1559454
• Minimizing the average deviation of job completion times about a common due date
• Minimizing mean absolute 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 the maximum deviation of job completion time about a common due-date
• An exact algorithm to minimize mean squared deviation of job completion times about a common due date
• Simultaneous minimization of total completion time and total deviation of job completion times
• Minimizing Mean Squared Deviation of Completion Times About a Common Due Date
• Minimizing the total weighted completion time of deteriorating jobs
• Minimizing total completion time and total deviation of job completion times from a restrictive due-date

Cites work

• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
• A half-product based approximation scheme for agreeably weighted completion time variance
• Completion time variance minimization on a single machine is difficult
• CON due-date determination and sequencing
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Fast fully polynomial approximation schemes for minimizing completion time variance
• FPTAS for half-products minimization with scheduling applications
• scientific article; zbMATH DE number 1559454 (Why is no real title available?)
• Mimimization of agreeably weighted variance in single machine systems
• Minimising Waiting Time Variance in the Single Machine Problem
• Minimizing Variation of Flow Time in Single Machine Systems
• Minimizing weighted mean absolute deviation of flow times in single machine systems
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Sequencing with Earliness and Tardiness Penalties: A Review
• Variance Minimization in Single Machine Sequencing Problems

Cited in

(5)

• Equivalence of mean flow time problems and mean absolute deviation problems
• Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job
• Mean completion time for a randomly varying rate of work
• Minimizing weighted mean absolute deviation of flow times in single machine systems
• scientific article; zbMATH DE number 1559454 (Why is no real title available?)

This page was built for publication: Minimizing weighted mean absolute deviation of job completion times from their weighted mean

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548013)