Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families (Q4671312): Difference between revisions

Latest revision as of 10:31, 10 June 2024

scientific article; zbMATH DE number 2161408

Language	Label	Description	Also known as
English	Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families	scientific article; zbMATH DE number 2161408

Statements

instance of

scholarly article

0 references

title

Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families (English)

0 references

0 references

0 references

0 references

0 references

International Journal of Production Research

0 references

publication date

26 April 2005

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/00207540410001704041

0 references

cites work

Batching and Scheduling Jobs on Batch and Discrete Processors

0 references

Control of a batch-processing machine: A computational approach

0 references

Managing batch processors to reduce lead time in a semiconductor packaging line

0 references

Minimizing total completion time on a batch processing machine with job families

0 references

The Batch Loading and Scheduling Problem

0 references

Bounds on Multiprocessing Timing Anomalies

0 references

Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime

0 references

Efficient scheduling algorithms for a single batch processing machine

0 references

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

0 references

Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem

0 references

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

0 references

Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

0 references

Scheduling a single batch processing machine with non-identical job sizes

0 references

Scheduling batch processing machines with incompatible job families

0 references

Identifiers

zbMATH Open document ID

1060.90643

0 references

DOI

10.1080/00207540410001704041

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4671312

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207540410001704041
+Normal rank
@@ Property / OpenAlex ID @@
+W2092016688
@@ Property / OpenAlex ID: W2092016688 / rank @@
+Normal rank
@@ Property / cites work @@
+Batching and Scheduling Jobs on Batch and Discrete Processors
+Normal rank
@@ Property / cites work @@
+Control of a batch-processing machine: A computational approach
+Normal rank
@@ Property / cites work @@
+Managing batch processors to reduce lead time in a semiconductor packaging line
+Normal rank
@@ Property / cites work @@
+Minimizing total completion time on a batch processing machine with job families
+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 @@
+Bounds on Multiprocessing Timing Anomalies
@@ Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
+Normal rank
@@ Property / cites work @@
+Efficient scheduling algorithms for a single batch processing machine
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
+Normal rank
@@ Property / cites work @@
+Minimizing makespan on a single batch processing machine with dynamic job arrivals
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
+Normal rank
@@ Property / cites work @@
+Scheduling a single batch processing machine with non-identical job sizes
+Normal rank
@@ Property / cites work @@
+Scheduling batch processing machines with incompatible job families
+Normal rank