A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063): Difference between revisions

Latest revision as of 09:09, 11 December 2024

scientific article

Language	Label	Description	Also known as
English	A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals	scientific article

Statements

instance of

scholarly article

0 references

title

A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (English)

0 references

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

15 November 2012

0 references

zbMATH Keywords

branch and bound algorithm

0 references

dynamic arrivals

0 references

batch scheduling

0 references

incompatible job families

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2011.06.003

0 references

cites work

Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time

0 references

Scheduling with batching: A review

0 references

Scheduling Groups of Jobs on a Single Machine

0 references

Batching identical jobs

0 references

Scheduling a batching machine

0 references

Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

0 references

The use of upstream and downstream information in scheduling semiconductor batch operations

0 references

Dynamic job assignment heuristics for multi-server batch operations- A cost based approach

0 references

A new dynamic look-ahead scheduling procedure for batching machines

0 references

Scheduling batch processing machines with incompatible job families

0 references

Minimizing total weighted tardiness on a single batch process machine with incompatible job families

0 references

Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times

0 references

A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival

0 references

Q4017560

0 references

Lower bounds for parallel machine scheduling problems

0 references

Some simple scheduling algorithms

0 references

Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm

0 references

Identifiers

zbMATH Open document ID

1251.90204

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1016/J.COR.2011.06.003

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1762063

@@ Property / DOI @@
-.1016/j.cor.2011.06.003
@@ Property / DOI: 10.1016/j.cor.2011.06.003 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cor.2011.06.003
+Normal rank
@@ Property / OpenAlex ID @@
+W1995270512
@@ Property / OpenAlex ID: W1995270512 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
+Normal rank
@@ Property / cites work @@
+Scheduling with batching: A review
@@ Property / cites work: Scheduling with batching: A review / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Groups of Jobs on a Single Machine
@@ Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank @@
+Normal rank
@@ Property / cites work @@
+Batching identical jobs
@@ Property / cites work: Batching identical jobs / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling a batching machine
@@ Property / cites work: Scheduling a batching machine / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
+Normal rank
@@ Property / cites work @@
+The use of upstream and downstream information in scheduling semiconductor batch operations
+Normal rank
@@ Property / cites work @@
+Dynamic job assignment heuristics for multi-server batch operations- A cost based approach
+Normal rank
@@ Property / cites work @@
+A new dynamic look-ahead scheduling procedure for batching machines
+Normal rank
@@ Property / cites work @@
+Scheduling batch processing machines with incompatible job families
+Normal rank
@@ Property / cites work @@
+Minimizing total weighted tardiness on a single batch process machine with incompatible job families
+Normal rank
@@ Property / cites work @@
+Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
+Normal rank
@@ Property / cites work @@
+A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
+Normal rank
@@ Property / cites work @@
+Q4017560
@@ Property / cites work: Q4017560 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for parallel machine scheduling problems
+Normal rank
@@ Property / cites work @@
+Some simple scheduling algorithms
@@ Property / cites work: Some simple scheduling algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2011.06.003
@@ Property / DOI: 10.1016/J.COR.2011.06.003 / rank @@
+Normal rank