Parallel-machine scheduling with release dates and rejection

DOI10.1007/S10288-016-0304-4zbMath1338.90189OpenAlexW2249395966MaRDI QIDQ295880

Li-Qi Zhang, Ling-Fa Lu

Publication date: 14 June 2016

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

Full work available at URL: https://doi.org/10.1007/s10288-016-0304-4

zbMATH Keywords

schedulingdynamic programmingFPTASrejection penalty

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (14)

Vector scheduling with rejection on two machines ⋮ Scheduling with release times and rejection on two parallel machines ⋮ Faster algorithms for single machine scheduling with release dates and rejection ⋮ 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 ⋮ Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties ⋮ Coordinated scheduling of the outsourcing, in-house production and distribution operations ⋮ Algorithms for single machine scheduling problem with release dates and submodular penalties ⋮ Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection ⋮ Machine scheduling with job rejection and Dejong's learning effect ⋮ Vector scheduling with rejection on a single machine ⋮ Improved approximation algorithms for parallel machine scheduling with release dates and job rejection ⋮ Minmax scheduling and due-window assignment with position-dependent processing times and job rejection

Cites Work

• A survey on offline scheduling with rejection
• Scheduling linear deteriorating jobs with rejection on a single machine
• Single machine scheduling with release dates and rejection
• Preemptive scheduling with rejection
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Scheduling with machine cost and rejection
• Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
• Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Preemptive multiprocessor scheduling with rejection

This page was built for publication: Parallel-machine scheduling with release dates and rejection