Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework (Q3545663)
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 a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework |
scientific article; zbMATH DE number 5381552
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework |
scientific article; zbMATH DE number 5381552 |
Statements
Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework (English)
0 references
11 December 2008
0 references
scheduling
0 references
batch-processing machine
0 references
total weighted completion time
0 references
ant colony optimization
0 references
0.8382862210273743
0 references
0.8318609595298767
0 references
0.8313999176025391
0 references
0.8224077224731445
0 references
