Penalty cost constrained identical parallel machine scheduling problem

DOI10.1016/J.TCS.2015.10.007zbMATH Open1333.90048OpenAlexW1854554296MaRDI QIDQ897945FDOQ897945

Xuejie Zhang, Weidong Li, Zhibin Chen, Jianping Li

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

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

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)

Cites Work

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

Cited In (21)

• Machine scheduling with restricted rejection: an application to task offloading in cloud-edge collaborative computing
• Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates
• Vector scheduling with rejection on a single machine
• Bicriteria order acceptance and scheduling with consideration of fill rate
• Approximation scheme for single-machine rescheduling with job delay and rejection
• The constrained parallel-machine scheduling problem with divisible processing times and penalties
• Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
• The prize-collecting single machine scheduling with bounds and penalties
• Approximation algorithms for the multiprocessor scheduling with submodular penalties
• Vector scheduling with rejection on two machines
• Title not available (Why is that?)
• Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
• \(W\)-prize-collecting scheduling problem on parallel machines
• Minimizing the maximum lateness for scheduling with release times and job rejection
• Algorithms for single machine scheduling problem with release dates and submodular penalties
• On-line single machine scheduling with release dates and submodular rejection penalties
• Bag-of-tasks scheduling with rejection in large computing systems
• On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan
• Parallel machine scheduling with restricted job rejection
• Order acceptance and scheduling with consideration of service level
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection

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)