Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines (Q290334): Difference between revisions

Latest revision as of 01:58, 12 July 2024

scientific article

Language	Label	Description	Also known as
English	Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines	scientific article

Statements

instance of

scholarly article

0 references

title

Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines (English)

0 references

0 references

0 references

Journal of the Operations Research Society of China

0 references

publication date

1 June 2016

0 references

zbMATH Keywords

scheduling

0 references

online algorithms

0 references

total weighted completion time

0 references

rejection

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s40305-015-0093-z

0 references

cites work

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Multiprocessor Scheduling with Rejection

0 references

On-line scheduling of unit time jobs with rejection: Minimizing the total completion time

0 references

Preemptive multiprocessor scheduling with rejection

0 references

Scheduling with machine cost and rejection

0 references

Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost

0 references

Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time

0 references

Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms

0 references

Identifiers

zbMATH Open document ID

1338.90175

0 references

DOI

10.1007/s40305-015-0093-z

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:290334

@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6588365
@@ Property / zbMATH DE Number: 6588365 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling
@@ Property / zbMATH Keywords: scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+online algorithms
@@ Property / zbMATH Keywords: online algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+total weighted completion time
@@ Property / zbMATH Keywords: total weighted completion time / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+rejection
@@ Property / zbMATH Keywords: rejection / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s40305-015-0093-z
+Normal rank
@@ Property / OpenAlex ID @@
+W1216488046
@@ Property / OpenAlex ID: W1216488046 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
+Normal rank
@@ Property / cites work @@
+Multiprocessor Scheduling with Rejection
@@ Property / cites work: Multiprocessor Scheduling with Rejection / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
+Normal rank
@@ Property / cites work @@
+Preemptive multiprocessor scheduling with rejection
+Normal rank
@@ Property / cites work @@
+Scheduling with machine cost and rejection
@@ Property / cites work: Scheduling with machine cost and rejection / rank @@
+Normal rank
@@ Property / cites work @@
+Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
+Normal rank
@@ Property / cites work @@
+Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
+Normal rank
@@ Property / cites work @@
+Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:290334