Single Machine Scheduling with an Availability Constraint and Rejection

DOI10.1142/S0217595914500377zbMath1299.90181MaRDI QIDQ2931173

Heng-Yong Tang, Chuan-Li Zhao

Publication date: 24 November 2014

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

zbMATH Keywords

schedulingdynamic programmingrejection penaltymachine availabilityfully polynomial-time approximation scheme

Mathematics Subject Classification ID

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

Related Items (1)

Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine

Cites Work

• Unnamed Item
• Single machine flow-time scheduling with scheduled maintenance
• Improved algorithms for two single machine scheduling problems
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Single machine scheduling with release dates and rejection
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• Preemptive scheduling with rejection
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
• Machine scheduling with an availability constraint
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection

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