Job shop scheduling with separable sequence-dependent setups (Q1374429)
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 1094931
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Job shop scheduling with separable sequence-dependent setups |
scientific article; zbMATH DE number 1094931 |
Statements
Job shop scheduling with separable sequence-dependent setups (English)
0 references
4 December 1997
0 references
separable sequence-dependent setups
0 references
shop scheduling
0 references
polynomial time heuristic
0 references
0.8458559513092041
0 references
0.829679548740387
0 references
0.8243639469146729
0 references
0.8189119100570679
0 references
