Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times (Q6602333)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times |
scientific article; zbMATH DE number 7910951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times |
scientific article; zbMATH DE number 7910951 |
Statements
Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times (English)
0 references
11 September 2024
0 references
scheduling
0 references
job shop
0 references
server
0 references
set-up times
0 references
complexity
0 references
meta-heuristic
0 references
0 references
0 references
0 references
0 references
0 references
0.8704601526260376
0 references
0.848042368888855
0 references
0.846971333026886
0 references
0.8439118266105652
0 references
0.8425092101097107
0 references
