Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines (Q2806872): Difference between revisions

Latest revision as of 00:04, 12 July 2024

scientific article

Language	Label	Description	Also known as
English	Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines	scientific article

Statements

instance of

scholarly article

0 references

title

Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines (English)

0 references

author

Akiyoshi Shioura

0 references

Natalia V. Shakhlevich

0 references

Vitaly A. Strusevich

0 references

published in

INFORMS Journal on Computing

0 references

publication date

19 May 2016

0 references

zbMATH Keywords

programming

0 references

linear

0 references

production scheduling

0 references

deterministic

0 references

single machine

0 references

analysis of algorithms

0 references

computational complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1287/ijoc.2015.0660

0 references

cites work

Improved Algorithms for Bipartite Network Flow

0 references

Speed Scaling for Weighted Flow Time

0 references

Power-aware scheduling for makespan and flow

0 references

Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques

0 references

A Fast Parametric Maximum Flow Algorithm and Applications

0 references

Minimizing the number of tardy job units under release time constraints

0 references

Some simple scheduling algorithms

0 references

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions

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

A survey of results for sequencing problems with controllable processing times

0 references

A combinatorial algorithm minimizing submodular functions in strongly polynomial time.

0 references

A survey of scheduling with controllable processing times

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

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

0 references

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION

0 references

Algorithms for Scheduling Imprecise Computations with Timing Constraints

0 references

A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines

0 references

Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times

0 references

Identifiers

zbMATH Open document ID

1338.90182

0 references

DOI

10.1287/ijoc.2015.0660

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2806872

@@ Property / cites work @@
+Improved Algorithms for Bipartite Network Flow
@@ Property / cites work: Improved Algorithms for Bipartite Network Flow / rank @@
+Normal rank
@@ Property / cites work @@
+Speed Scaling for Weighted Flow Time
@@ Property / cites work: Speed Scaling for Weighted Flow Time / rank @@
+Normal rank
@@ Property / cites work @@
+Power-aware scheduling for makespan and flow
@@ Property / cites work: Power-aware scheduling for makespan and flow / rank @@
+Normal rank
@@ Property / cites work @@
+Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
+Normal rank
@@ Property / cites work @@
+A Fast Parametric Maximum Flow Algorithm and Applications
+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 @@
+A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
+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 @@
+A survey of results for sequencing problems with controllable processing times
+Normal rank
@@ Property / cites work @@
+A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
+Normal rank
@@ Property / cites work @@
+A survey of scheduling with controllable processing times
+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 @@
+Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
+Normal rank
@@ Property / cites work @@
+SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
+Normal rank
@@ Property / cites work @@
+Algorithms for Scheduling Imprecise Computations with Timing Constraints
+Normal rank
@@ Property / cites work @@
+A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines
+Normal rank
@@ Property / cites work @@
+Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
+Normal rank