Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families (Q1734827): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128288129, #quickstatements; #temporary_batch_1723473115199 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128288129 / rank | |||
Normal rank | |||
Latest revision as of 15:35, 12 August 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
