Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7043523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families |
scientific article; zbMATH DE number 7043523 |
Statements
Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (English)
0 references
27 March 2019
0 references
batch processing machine
0 references
heuristics
0 references
maximum lateness
0 references
lower bound
0 references
job families
0 references
0 references
0 references
0.8929767608642578
0 references
0.8415466547012329
0 references
0.8390184640884399
0 references
0.8365891575813293
0 references
0.8333740830421448
0 references
