Penalty cost constrained identical parallel machine scheduling problem

DOI10.1016/J.TCS.2015.10.007MaRDI QIDQ897945zbMATH OpenOpenAlexFDO

Authors Weidong Li, Jianping Li, Xuejie Zhang, Zhibin Chen

Publication date 8 December 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.10.007

zbMATH Keywords

approximation algorithmsschedulingrejection penaltypolynomial time approximation schemefully polynomial time approximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 1875417 (Why is no real title available?)
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• A survey on offline scheduling with rejection
• An approximation algorithm for the generalized assignment problem
• Approximation schemes for scheduling on parallel machines
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Bounds for Certain Multiprocessing Anomalies
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Improved approximation schemes for scheduling unrelated parallel machines
• Minimizing the makespan on a single parallel batching machine
• Multiprocessor Scheduling with Rejection
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive multiprocessor scheduling with rejection
• Preemptive scheduling with rejection
• Scheduling linear deteriorating jobs with rejection on a single machine
• Scheduling with Rejection to Minimize the Makespan
• Scheduling with rejection and non-identical job arrivals
• Single machine scheduling with release dates and rejection
• Single-machine scheduling under the job rejection constraint
• Techniques for scheduling with rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

Cited in

(22)

• The prize-collecting single machine scheduling with bounds and penalties
• Approximation scheme for single-machine rescheduling with job delay and rejection
• The constrained parallel-machine scheduling problem with divisible processing times and penalties
• On-line single machine scheduling with release dates and submodular rejection penalties
• Single machine scheduling with outsourcing under different fill rates or quantity discount rates
• scientific article; zbMATH DE number 1875417 (Why is no real title available?)
• Algorithms for single machine scheduling problem with release dates and submodular penalties
• Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing
• On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan
• \(W\)-prize-collecting scheduling problem on parallel machines
• Minimizing the maximum lateness for scheduling with release times and job rejection
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
• Bicriteria order acceptance and scheduling with consideration of fill rate
• Bag-of-tasks scheduling with rejection in large computing systems
• Vector scheduling with rejection on two machines
• Parallel machine scheduling with restricted job rejection
• Order acceptance and scheduling with consideration of service level
• Vector scheduling with rejection on a single machine
• Parallel-machine scheduling problem under the job rejection constraint (extended abstract)
• Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
• Approximation algorithms for the multiprocessor scheduling with submodular penalties

This page was built for publication: Penalty cost constrained identical parallel machine scheduling problem

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