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

DOI10.1007/S10288-016-0339-6MaRDI QIDQ681293zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmrejectionrelease datescheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Parallel-machine scheduling with release dates and rejection
• New approximation algorithms for machine scheduling with rejection on single and parallel machine
• Scheduling with release times and rejection on two parallel machines
• Parallel machine scheduling with restricted job rejection
• Parallel-machine scheduling problem under the job rejection constraint (extended abstract)

Cites work

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

Cited in

(26)

• Bounded single-machine parallel-batch scheduling with release dates and rejection
• 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
• Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
• Scheduling with release times and rejection on two parallel machines
• Exact and approximate methods for parallel multiple-area spatial scheduling with release times
• Parallel machine scheduling with restricted job rejection
• Coordinated scheduling of the outsourcing, in-house production and distribution operations
• Faster algorithms for single machine scheduling with release dates and rejection
• Parallel-machine scheduling with release dates and rejection
• Vector scheduling with rejection on two machines
• Algorithms for single machine scheduling problem with release dates and submodular penalties
• Machine scheduling with job rejection and Dejong's learning effect
• Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing
• An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties
• Minimizing the maximum lateness for scheduling with release times and job rejection
• W-prize-collecting with release dates on a single machine
• Coordinated order scheduling and outsourcing on dedicated parallel machines
• Scheduling on parallel-batch machines with rejection and resource matching
• Two-machine job shop scheduling with optional job rejection
• Bounded mixed batch scheduling with job release dates and rejection
• Multiple identical serial-batch machines scheduling with release dates and submodular rejection penalties
• New approximation algorithms for machine scheduling with rejection on single and parallel machine
• Minimizing maximum delivery completion time for order scheduling with rejection
• Penalty cost constrained identical parallel machine scheduling problem

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

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