Vector scheduling with rejection on two machines

DOI10.1080/00207160.2019.1711373MaRDI QIDQ5031186zbMATH OpenOpenAlexWikidataFDO

Authors Bingfei Dai, Weidong Li

Publication date 18 February 2022

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2019.1711373

zbMATH Keywords

approximation algorithmonline algorithmrejectionvector scheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Vector scheduling with rejection on a single machine
• Scheduling with release times and rejection on two parallel machines
• scientific article; zbMATH DE number 871904
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection

Cites work

• An improved heuristic for parallel machine scheduling with rejection
• Approximating vector scheduling: almost matching upper and lower bounds
• Bicriteria order acceptance and scheduling with consideration of fill rate
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
• Multiprocessor Scheduling with Rejection
• On Multidimensional Packing Problems
• 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
• Randomized algorithms for online vector load balancing
• Swarm optimization algorithms applied to multi-resource fair allocation in heterogeneous cloud computing systems
• Tight bounds for online vector scheduling
• Vector scheduling with rejection on a single machine

Cited in

(11)

• Vector scheduling with rejection on a single machine
• Online vector scheduling and generalized load balancing
• Vector assignment problems: a general framework
• Approximating vector scheduling: almost matching upper and lower bounds
• On-line single machine scheduling with release dates and submodular rejection penalties
• On the parameterized tractability of single machine scheduling with rejection to minimize the weighted makespan
• 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
• Approximating vector scheduling: almost matching upper and lower bounds
• Approximation algorithms for the parallel-machine customer order scheduling with weighted and submodular rejection penalties

This page was built for publication: Vector scheduling with rejection on two machines

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