Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585): Difference between revisions

Latest revision as of 12:36, 5 July 2024

scientific article

Language	Label	Description	Also known as
English	Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs	scientific article

Statements

instance of

scholarly article

0 references

title

Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (English)

0 references

zbMATH Open document ID

1243.68115

0 references

DOI

10.1016/j.ipl.2012.03.015

0 references

0 references

0 references

0 references

0 references

Information Processing Letters

0 references

publication date

25 July 2012

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

scheduling

0 references

preemption with restart

0 references

incompatible families

0 references

batch machines

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ipl.2012.03.015

0 references

OpenAlex ID

W2025916581

0 references

cites work

Better Bounds for Online Scheduling

0 references

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

0 references

Scheduling a batching machine

0 references

Q4247460

0 references

Online competitive algorithms for maximizing weighted throughput of unit jobs

0 references

Online Scheduling of Bounded Length Jobs to Maximize Throughput

0 references

Approximation algorithms in batch processing

0 references

On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs

0 references

A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine

0 references

Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines

0 references

Minimizing makespan on a single batch processing machine with dynamic job arrivals

0 references

Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead

0 references

Minimizing makespan in batch machine scheduling

0 references

On-line scheduling algorithms for a batch machine with finite capacity

0 references

Q4821818

0 references

Improved Bounds for the Online Scheduling Problem

0 references

Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs

0 references

Q4368485

0 references

On-line algorithms for minimizing makespan on batch processing machines

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:436585

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2012.03.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2025916581
@@ Property / OpenAlex ID: W2025916581 / rank @@
+Normal rank
@@ Property / cites work @@
+Better Bounds for Online Scheduling
@@ Property / cites work: Better Bounds for Online Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
+Normal rank
@@ Property / cites work @@
+Scheduling a batching machine
@@ Property / cites work: Scheduling a batching machine / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247460
@@ Property / cites work: Q4247460 / rank @@
+Normal rank
@@ Property / cites work @@
+Online competitive algorithms for maximizing weighted throughput of unit jobs
+Normal rank
@@ Property / cites work @@
+Online Scheduling of Bounded Length Jobs to Maximize Throughput
+Normal rank
@@ Property / cites work @@
+Approximation algorithms in batch processing
@@ Property / cites work: Approximation algorithms in batch processing / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
+Normal rank
@@ Property / cites work @@
+A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
+Normal rank
@@ Property / cites work @@
+Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single batch processing machine with dynamic job arrivals
+Normal rank
@@ Property / cites work @@
+Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
+Normal rank
@@ Property / cites work @@
+Minimizing makespan in batch machine scheduling
@@ Property / cites work: Minimizing makespan in batch machine scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling algorithms for a batch machine with finite capacity
+Normal rank
@@ Property / cites work @@
+Q4821818
@@ Property / cites work: Q4821818 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Bounds for the Online Scheduling Problem
@@ Property / cites work: Improved Bounds for the Online Scheduling Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs
+Normal rank
@@ Property / cites work @@
+Q4368485
@@ Property / cites work: Q4368485 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line algorithms for minimizing makespan on batch processing machines
+Normal rank