Minimizing the number of switch instances on a flexible machine in polynomial time (Q1785367)
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: Minimizing the number of switch instances on a flexible machine in polynomial time |
scientific article; zbMATH DE number 6945362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the number of switch instances on a flexible machine in polynomial time |
scientific article; zbMATH DE number 6945362 |
Statements
Minimizing the number of switch instances on a flexible machine in polynomial time (English)
0 references
28 September 2018
0 references
scheduling
0 references
tool switching
0 references
combinatorial algorithm
0 references
manufacturing
0 references
flexible machine
0 references
0 references
0 references
0.845268964767456
0 references
0.8331866264343262
0 references
0.8329708576202393
0 references
0.8301613330841064
0 references
