Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562)
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: Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost |
scientific article; zbMATH DE number 7037949
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost |
scientific article; zbMATH DE number 7037949 |
Statements
Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (English)
0 references
19 March 2019
0 references
scheduling
0 references
two-agent
0 references
due date
0 references
Pareto optimization
0 references
0 references
0 references
0 references
0 references
0 references
