Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines (Q5169463): Difference between revisions

Latest revision as of 17:26, 8 July 2024

scientific article; zbMATH DE number 6316005

Language	Label	Description	Also known as
English	Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines	scientific article; zbMATH DE number 6316005

Statements

instance of

scholarly article

0 references

title

Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines (English)

0 references

0 references

0 references

0 references

0 references

10 July 2014

0 references

zbMATH Keywords

semi-online scheduling

0 references

list scheduling

0 references

competitive ratio

0 references

parallel machines

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/02331934.2014.895902

0 references

cites work

An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling

0 references

New algorithms for an ancient scheduling problem.

0 references

New lower and upper bounds for on-line scheduling

0 references

A Better Algorithm for an Ancient Scheduling Problem

0 references

Better Bounds for Online Scheduling

0 references

On-line scheduling revisited

0 references

On-line scheduling for jobs with arbitrary release times

0 references

Improved algorithm for a generalized on-line scheduling problem on identical machines

0 references

List scheduling for jobs with arbitrary release times and similar lengths

0 references

Semi on-line algorithms for the partition problem

0 references

Semi on-line scheduling on two identical machines

0 references

Ordinal algorithms for parallel machine scheduling

0 references

A Note on Online Scheduling for Jobs with Arbitrary Release Times

0 references

Semi-online algorithms for parallel machine scheduling problems

0 references

Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times

0 references

Semi-on-line problems on two identical machines with combined partial information

0 references

Bounds on Multiprocessing Timing Anomalies

0 references

Identifiers

zbMATH Open document ID

1311.90050

0 references

DOI

10.1080/02331934.2014.895902

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5169463

@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331934.2014.895902
+Normal rank
@@ Property / OpenAlex ID @@
+W2028445684
@@ Property / OpenAlex ID: W2028445684 / rank @@
+Normal rank
@@ Property / cites work @@
+An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
+Normal rank
@@ Property / cites work @@
+New algorithms for an ancient scheduling problem.
@@ Property / cites work: New algorithms for an ancient scheduling problem. / rank @@
+Normal rank
@@ Property / cites work @@
+New lower and upper bounds for on-line scheduling
@@ Property / cites work: New lower and upper bounds for on-line scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+A Better Algorithm for an Ancient Scheduling Problem
+Normal rank
@@ Property / cites work @@
+Better Bounds for Online Scheduling
@@ Property / cites work: Better Bounds for Online Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling revisited
@@ Property / cites work: On-line scheduling revisited / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling for jobs with arbitrary release times
+Normal rank
@@ Property / cites work @@
+Improved algorithm for a generalized on-line scheduling problem on identical machines
+Normal rank
@@ Property / cites work @@
+List scheduling for jobs with arbitrary release times and similar lengths
+Normal rank
@@ Property / cites work @@
+Semi on-line algorithms for the partition problem
@@ Property / cites work: Semi on-line algorithms for the partition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Semi on-line scheduling on two identical machines
@@ Property / cites work: Semi on-line scheduling on two identical machines / rank @@
+Normal rank
@@ Property / cites work @@
+Ordinal algorithms for parallel machine scheduling
+Normal rank
@@ Property / cites work @@
+A Note on Online Scheduling for Jobs with Arbitrary Release Times
+Normal rank
@@ Property / cites work @@
+Semi-online algorithms for parallel machine scheduling problems
+Normal rank
@@ Property / cites work @@
+Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
+Normal rank
@@ Property / cites work @@
+Semi-on-line problems on two identical machines with combined partial information
+Normal rank
@@ Property / cites work @@
+Bounds on Multiprocessing Timing Anomalies
@@ Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank @@
+Normal rank