Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827): Difference between revisions
From MaRDI portal
Revision as of 22:42, 18 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families |
scientific article |
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