Scheduling batch processing machines with incompatible job families (Q4399080)
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: Scheduling batch processing machines with incompatible job families |
scientific article; zbMATH DE number 1179759
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling batch processing machines with incompatible job families |
scientific article; zbMATH DE number 1179759 |
Statements
Scheduling batch processing machines with incompatible job families (English)
0 references
30 March 1999
0 references
single batch processing machine
0 references
incompatible job families
0 references
makespan
0 references
maximum lateness
0 references
neuristics
0 references
0 references
0 references
0 references
0 references
0.9527296
0 references
0.94497496
0 references
0.9393213
0 references
0.9345994
0 references
0.9267722
0 references
0.9240339
0 references
0.9224796
0 references
