Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133): Difference between revisions

Latest revision as of 20:10, 28 June 2024

scientific article

Language	Label	Description	Also known as
English	Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach	scientific article

Statements

instance of

scholarly article

0 references

title

Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (English)

0 references

author

Natalia V. Shakhlevich

0 references

Akiyoshi Shioura

0 references

Vitaly A. Strusevich

0 references

published in

Algorithms - ESA 2008

0 references

publication date

25 November 2008

0 references

full work available at URL

http://eprints.whiterose.ac.uk/5397/1/shakhlevitchn1.pdf

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Improved Algorithms for Bipartite Network Flow

0 references

Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques

0 references

Submodular functions and optimization.

0 references

A Fast Parametric Maximum Flow Algorithm and Applications

0 references

Preemptive Scheduling of Uniform Processor Systems

0 references

Minimizing the number of tardy job units under release time constraints

0 references

Some simple scheduling algorithms

0 references

Single machine scheduling subject to deadlines and resource dependent processing times

0 references

Minimizing the weighted number of tardy task units

0 references

Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow

0 references

Scheduling with Deadlines and Loss Functions

0 references

A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times

0 references

Preemptive Scheduling with Due Dates

0 references

Scheduling Independent Tasks with Due Times on a Uniform Processor System

0 references

Pre-emptive scheduling problems with controllable processing times

0 references

Preemptive scheduling on uniform parallel machines with controllable job processing times

0 references

Algorithms for Scheduling Imprecise Computations with Timing Constraints

0 references

Identifiers

zbMATH Open document ID

1158.90355

0 references

DOI

10.1007/978-3-540-87744-8_63

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3541133

@@ Property / OpenAlex ID @@
+W1581923154
@@ Property / OpenAlex ID: W1581923154 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Algorithms for Bipartite Network Flow
@@ Property / cites work: Improved Algorithms for Bipartite Network Flow / rank @@
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
+Normal rank
@@ Property / cites work @@
+Submodular functions and optimization.
@@ Property / cites work: Submodular functions and optimization. / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Uniform Processor Systems
+Normal rank
@@ Property / cites work @@
+Minimizing the number of tardy job units under release time constraints
+Normal rank
@@ Property / cites work @@
+Some simple scheduling algorithms
@@ Property / cites work: Some simple scheduling algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Single machine scheduling subject to deadlines and resource dependent processing times
+Normal rank
@@ Property / cites work @@
+Minimizing the weighted number of tardy task units
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
+Normal rank
@@ Property / cites work @@
+Scheduling with Deadlines and Loss Functions
@@ Property / cites work: Scheduling with Deadlines and Loss Functions / rank @@
+Normal rank
@@ Property / cites work @@
+A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling with Due Dates
@@ Property / cites work: Preemptive Scheduling with Due Dates / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Independent Tasks with Due Times on a Uniform Processor System
+Normal rank
@@ Property / cites work @@
+Pre-emptive scheduling problems with controllable processing times
+Normal rank
@@ Property / cites work @@
+Preemptive scheduling on uniform parallel machines with controllable job processing times
+Normal rank
@@ Property / cites work @@
+Algorithms for Scheduling Imprecise Computations with Timing Constraints
+Normal rank