Faster algorithms for single machine scheduling with release dates and rejection

DOI10.1016/J.IPL.2016.02.008zbMath1335.68306OpenAlexW2292778203MaRDI QIDQ280934

Chung-Lun Li, Jinwen Ou, Xueling Zhong

Publication date: 10 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.02.008

zbMATH Keywords

algorithmsschedulingrelease datesworst-case analysisrejection penalty

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (10)

In-house production and outsourcing under different discount schemes on the total outsourcing cost ⋮ New approximation algorithms for machine scheduling with rejection on single and parallel machine ⋮ Algorithms for single machine scheduling problem with release dates and submodular penalties ⋮ Parallel-batch scheduling with rejection: structural properties and approximation algorithms ⋮ Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection ⋮ Flowshop scheduling with learning effect and job rejection ⋮ Vector scheduling with rejection on a single machine ⋮ Improved approximation algorithms for parallel machine scheduling with release dates and job rejection ⋮ Single machine lot scheduling with optional job-rejection ⋮ Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates

Cites Work

• Improved algorithms for single machine scheduling with release dates and rejections
• Parallel-machine scheduling with release dates and rejection
• A survey on offline scheduling with rejection
• Single machine scheduling with release dates and rejection
• Unnamed Item

This page was built for publication: Faster algorithms for single machine scheduling with release dates and rejection