An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart (Q5024917): Difference between revisions

Latest revision as of 11:02, 30 July 2024

scientific article; zbMATH DE number 7467537

Language	Label	Description	Also known as
English	An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart	scientific article; zbMATH DE number 7467537

Statements

instance of

scholarly article

0 references

title

An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart (English)

0 references

0 references

0 references

Asia-Pacific Journal of Operational Research

0 references

publication date

1 February 2022

0 references

zbMATH Keywords

online scheduling

0 references

drop-line

0 references

parallel batch

0 references

limited restart

0 references

delivery

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Approximation algorithms in batch processing

0 references

The Batch Loading and Scheduling Problem

0 references

On-line scheduling on a batch machine to minimize makespan with limited restarts

0 references

Unbounded parallel-batch scheduling with drop-line tasks

0 references

Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

0 references

Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart

0 references

Scheduling Parallel Machines On-Line

0 references

The coordination of transportation and batching scheduling

0 references

Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time

0 references

Minimizing the total completion time on-line on a single machine, using restarts

0 references

On-line algorithms for minimizing makespan on batch processing machines

0 references

full work available at URL

https://doi.org/10.1142/s0217595921500111

0 references

Identifiers

zbMATH Open document ID

1481.90179

0 references

DOI

10.1142/S0217595921500111

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5024917

@@ Property / cites work @@
+Approximation algorithms in batch processing
@@ Property / cites work: Approximation algorithms in batch processing / rank @@
+Normal rank
@@ Property / cites work @@
+The Batch Loading and Scheduling Problem
@@ Property / cites work: The Batch Loading and Scheduling Problem / rank @@
+Normal rank
@@ Property / cites work @@
+On-line scheduling on a batch machine to minimize makespan with limited restarts
+Normal rank
@@ Property / cites work @@
+Unbounded parallel-batch scheduling with drop-line tasks
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
+Normal rank
@@ Property / cites work @@
+Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart
+Normal rank
@@ Property / cites work @@
+Scheduling Parallel Machines On-Line
@@ Property / cites work: Scheduling Parallel Machines On-Line / rank @@
+Normal rank
@@ Property / cites work @@
+The coordination of transportation and batching scheduling
+Normal rank
@@ Property / cites work @@
+Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time
+Normal rank
@@ Property / cites work @@
+Minimizing the total completion time on-line on a single machine, using restarts
+Normal rank
@@ Property / cites work @@
+On-line algorithms for minimizing makespan on batch processing machines
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0217595921500111
+Normal rank
@@ Property / OpenAlex ID @@
+W3135770504
@@ Property / OpenAlex ID: W3135770504 / rank @@
+Normal rank