Scheduling concurrent production over a finite planning horizon: Polynomially solvable cases (Q5926599)
From MaRDI portal
scientific article; zbMATH DE number 1577774
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
