Vector scheduling with rejection on a single machine

DOI10.1007/S10288-017-0356-0MaRDI QIDQ1743644zbMATH OpenOpenAlexFDO

Authors Weidong Li, Qianna Cui

Publication date 13 April 2018

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10288-017-0356-0

zbMATH Keywords

approximation algorithmsdynamic programmingfully polynomial time approximation schemevector scheduling

Mathematics Subject Classification ID

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

Recommendations

• Vector scheduling with rejection on two machines
• Single machine scheduling with release dates and rejection
• Single machine scheduling with rejection to minimize the weighted makespan
• New approximation algorithms for machine scheduling with rejection on single and parallel machine
• Single-machine scheduling under the job rejection constraint

Cites work

• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• A new polynomial-time algorithm for linear programming
• A survey on offline scheduling with rejection
• An improved heuristic for parallel machine scheduling with rejection
• Approximating vector scheduling: almost matching upper and lower bounds
• Approximation and online algorithms for multidimensional bin packing: a survey
• Approximation schemes for scheduling on parallel machines
• Faster algorithms for single machine scheduling with release dates and rejection
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 6820261 (Why is no real title available?)
• Improved algorithms for single machine scheduling with release dates and rejections
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
• Multiprocessor Scheduling with Rejection
• On Multidimensional Packing Problems
• On the optimality of approximation schemes for the classical scheduling problem
• Online multidimensional load balancing
• Online vector scheduling and generalized load balancing
• Parallel-machine scheduling with release dates and rejection
• Penalty cost constrained identical parallel machine scheduling problem
• Scheduling with release times and rejection on two parallel machines
• Single machine scheduling with release dates and rejection
• Single-machine scheduling under the job rejection constraint
• Tight bounds for online vector scheduling
• Vector assignment problems: a general framework
• Vector assignment schemes for asymmetric settings

Cited in

(11)

• A single machine scheduling problem with two-dimensional vector packing constraints
• Vector scheduling with rejection on two machines
• Approximation scheme for single-machine rescheduling with job delay and rejection
• On-line single machine scheduling with release dates and submodular rejection penalties
• Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
• On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan
• The prize-collecting single machine scheduling with bounds and penalties
• Minimizing the total weighted earliness-tardiness about a non-restrictive common due date with optional job rejection on single and multiple machines
• W-prize-collecting with release dates on a single machine
• Coordinated order scheduling and outsourcing on dedicated parallel machines
• Approximation algorithms for the combination of prize-collecting vertex cover and scheduling

This page was built for publication: Vector scheduling with rejection on a single machine

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