Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (Q1730482)
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: Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives |
scientific article; zbMATH DE number 7032550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives |
scientific article; zbMATH DE number 7032550 |
Statements
Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives (English)
0 references
6 March 2019
0 references
scheduling
0 references
competing agents
0 references
heuristic
0 references
combinatorial optimization
0 references
particle swarm optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8447629809379578
0 references
0.8176079988479614
0 references
0.8141745924949646
0 references
