Faster algorithms for single machine scheduling with release dates and rejection

DOI10.1016/J.IPL.2016.02.008MaRDI QIDQ280934zbMATH OpenOpenAlexFDO

Authors Jinwen Ou, Xueling Zhong, Chung-Lun Li

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

algorithmsschedulingrejection penaltyrelease datesworst-case analysis

Mathematics Subject Classification ID

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

Recommendations

• Single machine scheduling with release dates and rejection
• New approximation algorithms for machine scheduling with rejection on single and parallel machine
• Improved algorithms for single machine scheduling with release dates and rejections
• Scheduling on single machine and identical machines with rejection
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection

Cites work

• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• A survey on offline scheduling with rejection
• Improved algorithms for single machine scheduling with release dates and rejections
• Parallel-machine scheduling with release dates and rejection
• Single machine scheduling with release dates and rejection

Cited in

(21)

• Parallel-batch scheduling with rejection: structural properties and approximation algorithms
• Improved algorithms for single machine scheduling with release dates and rejections
• 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
• Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
• Two-machine job shop scheduling with optional job rejection
• Single machine scheduling with generalized due-dates, learning effect, and job-rejection
• Vector scheduling with rejection on a single machine
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Single machine scheduling with release dates and rejection
• Multiple identical serial-batch machines scheduling with release dates and submodular rejection penalties
• Single machine lot scheduling with optional job-rejection
• Flowshop scheduling with learning effect and job rejection
• Single-machine scheduling with release times, deadlines, setup times, and rejection
• Single machine scheduling with outsourcing under different fill rates or quantity discount rates
• W-prize-collecting with release dates on a single machine
• scientific article; zbMATH DE number 5151903 (Why is no real title available?)
• An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
• Algorithms for single machine scheduling problem with release dates and submodular penalties
• Scheduling on parallel-batch machines with rejection and resource matching
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection

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

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