Single Machine Scheduling with an Availability Constraint and Rejection

DOI10.1142/S0217595914500377MaRDI QIDQ2931173zbMATH OpenFDO

Authors Chuanli Zhao, Heng-Yong Tang

Publication date 24 November 2014

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0217595914500377

zbMATH Keywords

dynamic programmingfully polynomial-time approximation schememachine availabilityrejection penaltyscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Single-machine scheduling under the job rejection constraint
• A single machine scheduling problem with rejection jobs and a machine non-availability interval
• Single machine scheduling with non-availability interval and optional job rejection
• Single machine scheduling with rejection and generalized parameters
• scientific article; zbMATH DE number 5846621
• Single machine scheduling with an availability constraint to minimize makespan
• Scheduling on single machine and identical machines with rejection
• Scheduling a single machine with job rejection and due-window assignment
• A single machine scheduling problem with release dates, rejection and an unavailable interval
• Single machine scheduling with semi-resumable machine availability constraints

Cites work

• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• scientific article; zbMATH DE number 5345853 (Why is no real title available?)
• Improved algorithms for two single machine scheduling problems
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
• Machine scheduling with an availability constraint
• Multiprocessor Scheduling with Rejection
• Preemptive scheduling with rejection
• Single machine flow-time scheduling with scheduled maintenance
• Single machine scheduling with release dates and rejection
• Techniques for scheduling with rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

Cited in

(15)

• On the parameterized tractability of single machine scheduling with rejection
• Single machine scheduling with rejection to minimize the weighted makespan
• Single machine scheduling with non-availability interval and optional job rejection
• Order acceptance and scheduling with machine availability constraints
• Single-machine scheduling with production and rejection costs to minimize the maximum earliness
• Single machine scheduling with small operator-non-availability periods
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
• Order acceptance and two parallel machines scheduling problem with an availability constraint
• A single machine scheduling problem with release dates, rejection and an unavailable interval
• A single machine scheduling problem with rejection jobs and a machine non-availability interval
• Scheduling with rejection and a deteriorating maintenance activity on a single machine
• Single machine scheduling with an availability constraint to minimize makespan
• Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost
• A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection
• Single-machine scheduling under the job rejection constraint

This page was built for publication: Single Machine Scheduling with an Availability Constraint and Rejection

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