The complexity of cyclic shop scheduling problems (Q1607980)
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 1777550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of cyclic shop scheduling problems |
scientific article; zbMATH DE number 1777550 |
Statements
The complexity of cyclic shop scheduling problems (English)
0 references
8 August 2002
0 references
manufacturing
0 references
cyclic scheduling
0 references
sequencing
0 references
algorithms
0 references
complexity
0 references
0.8799574971199036
0 references
0.8760215640068054
0 references
0.8686621785163879
0 references
0.8673964142799377
0 references
