Improved approximation algorithms for parallel machine scheduling with release dates and job rejection

DOI10.1007/S10288-016-0339-6zbMath1387.90099OpenAlexW2563244478MaRDI QIDQ681293

Xueling Zhong, Jinwen Ou

Publication date: 30 January 2018

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-016-0339-6

zbMATH Keywords

schedulingapproximation algorithmrejectionrelease date

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Vector scheduling with rejection on two machines ⋮ New approximation algorithms for machine scheduling with rejection on single and parallel machine ⋮ Minimizing maximum delivery completion time for order scheduling with rejection ⋮ Parallel machine scheduling with restricted job rejection ⋮ Coordinated scheduling of the outsourcing, in-house production and distribution operations ⋮ Algorithms for single machine scheduling problem with release dates and submodular penalties ⋮ Machine scheduling with job rejection and Dejong's learning effect ⋮ Exact methods for order acceptance and scheduling on unrelated parallel machines ⋮ Vector scheduling with rejection on a single machine ⋮ Approximation algorithms for the multiprocessor scheduling with submodular penalties

Cites Work

• Improved algorithms for single machine scheduling with release dates and rejections
• Faster algorithms for single machine scheduling with release dates and rejection
• Parallel-machine scheduling with release dates and rejection
• A survey on offline scheduling with rejection
• Order acceptance and scheduling with consideration of service level
• Penalty cost constrained identical parallel machine scheduling problem
• Grouping techniques for scheduling problems: simpler and faster
• Single machine scheduling with release dates and rejection
• Scheduling parallel machines with inclusive processing set restrictions and job release times
• An approximation algorithm for the generalized assignment problem
• Scheduling on identical machines: How good is LPT in an on-line setting?
• Scheduling with release times and rejection on two parallel machines
• Efficient approximation schemes for scheduling problems with release dates and delivery times
• An improved heuristic for parallel machine scheduling with rejection
• Integer Programming with a Fixed Number of Variables
• Bounds for naive multiple machine scheduling with release times and deadlines
• Multiprocessor Scheduling with Rejection

This page was built for publication: Improved approximation algorithms for parallel machine scheduling with release dates and job rejection