Minimizing total completion time on a batch processing machine with job families (Q2367392)
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 243555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total completion time on a batch processing machine with job families |
scientific article; zbMATH DE number 243555 |
Statements
Minimizing total completion time on a batch processing machine with job families (English)
0 references
10 August 1993
0 references
semiconductor manufacturing
0 references
total completion time
0 references
single batch processing machine
0 references
polynomial time complexity
0 references
0.8730148673057556
0 references
0.8555859923362732
0 references
0.8510484099388123
0 references
0.8502720594406128
0 references
0.8439801335334778
0 references
