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

DOI10.3934/JIMO.2016033MaRDI QIDQ2628167zbMATH OpenOpenAlexFDO

Authors Chuanli 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

deteriorating jobsFPTASschedulingsingle machine

Mathematics Subject Classification ID

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

Recommendations

• Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs
• Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
• Approximation algorithms for minimizing the total weighted tardiness on a single machine
• An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates

Cites work

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

Cited in

(7)

• Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine
• A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
• Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
• Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
• Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs
• An FPTAS of minimizing total weighted completion time on single machine with position constraint
• New algorithms for minimizing the weighted number of tardy jobs on a single machine

This page was built for publication: An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs

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