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

DOI10.1016/j.amc.2011.04.020zbMath1231.90187OpenAlexW2119882783MaRDI QIDQ548013

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

schedulingapproximation schemedynamic program

Mathematics Subject Classification ID

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

Related Items

Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job

Cites Work

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