Customer order scheduling on a single machine with family setup times: complexity and algorithms (Q870129)
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: Customer order scheduling on a single machine with family setup times: complexity and algorithms |
scientific article; zbMATH DE number 5132893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Customer order scheduling on a single machine with family setup times: complexity and algorithms |
scientific article; zbMATH DE number 5132893 |
Statements
Customer order scheduling on a single machine with family setup times: complexity and algorithms (English)
0 references
12 March 2007
0 references
machine scheduling
0 references
computational complexity
0 references
dynamic programming
0 references
0.8260599970817566
0 references
0.8029336333274841
0 references
0.7784323692321777
0 references
0.7753697633743286
0 references
