Scheduling an unbounded batching machine with job processing time compatibilities (Q765334)
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 an unbounded batching machine with job processing time compatibilities |
scientific article; zbMATH DE number 6015782
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling an unbounded batching machine with job processing time compatibilities |
scientific article; zbMATH DE number 6015782 |
Statements
Scheduling an unbounded batching machine with job processing time compatibilities (English)
0 references
19 March 2012
0 references
batching machine
0 references
compatibility
0 references
complexity
0 references
dynamic programming
0 references
0 references
0 references
0 references
0.95485973
0 references
0.9358011
0 references
0.9337902
0 references
0.9239895
0 references
0.91739506
0 references
0.91496146
0 references
0.9147791
0 references
0.9120388
0 references
