Scheduling concurrent production over a finite planning horizon: Polynomially solvable cases (Q5926599)
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 1577774
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling concurrent production over a finite planning horizon: Polynomially solvable cases |
scientific article; zbMATH DE number 1577774 |
Statements
Scheduling concurrent production over a finite planning horizon: Polynomially solvable cases (English)
0 references
13 May 2001
0 references
manufacturing system
0 references
scheduling
0 references
combinatorial problem
0 references
0 references
0 references
0 references
0 references
0.8303775191307068
0 references
0.8286734819412231
0 references
0.8052881956100464
0 references
0.8004355430603027
0 references
0.789526641368866
0 references
