A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios

DOI10.1007/s12597-009-0026-xzbMath1201.90082MaRDI QIDQ1956478

Sakib A. Mondal

Publication date: 22 September 2010

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-009-0026-x

zbMATH Keywords

scheduling; just-in-time; fully polynomial approximation scheme

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Cites Work

• Unnamed Item
• Scheduling around a small common due date
• Scheduling to minimize weighted earliness and tardiness about a common due-date
• Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties
• The weighted common due date single machine scheduling problem revisited
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems