A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q126863058, #quickstatements; #temporary_batch_1722205759638 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126863058 / rank | |||
Normal rank | |||
Latest revision as of 00:53, 29 July 2024
scientific article; zbMATH DE number 1620088
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times |
scientific article; zbMATH DE number 1620088 |
Statements
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (English)
0 references
12 July 2001
0 references
permutation flow shop
0 references
makespan
0 references
release times
0 references
branch-and-bound algorithm
0 references
fuzzy search strategy
0 references
0 references
0 references
0 references
