An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs

DOI10.3934/jimo.2016033zbMath1364.90168OpenAlexW2399328427MaRDI QIDQ2628167

Chuan-Li Zhao

Publication date: 12 June 2017

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2016033

zbMATH Keywords

schedulingdeteriorating jobssingle machineFPTAS

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Deterministic scheduling theory in operations research (90B35)

Related Items

Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs

Cites Work

• Unnamed Item
• Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
• Scheduling with time-dependent execution times
• Time-dependent scheduling
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• Minimizing the total weighted completion time of deteriorating jobs
• A note on single-processor scheduling with time-dependent execution times
• Scheduling with time dependent processing times: Review and extensions
• Scheduling Deteriorating Jobs on a Single Processor
• NP-hard cases in scheduling deteriorating jobs on dedicated machines
• A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
• Scheduling
• Minimizing maximum lateness under linear deterioration