Bicriterion scheduling with a negotiable common due window and resource-dependent processing times (Q2004709)
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: Bicriterion scheduling with a negotiable common due window and resource-dependent processing times |
scientific article; zbMATH DE number 7256966
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bicriterion scheduling with a negotiable common due window and resource-dependent processing times |
scientific article; zbMATH DE number 7256966 |
Statements
Bicriterion scheduling with a negotiable common due window and resource-dependent processing times (English)
0 references
7 October 2020
0 references
scheduling
0 references
common due-window assignment
0 references
resource-dependent processing times
0 references
Pareto-optimal point
0 references
0 references
0 references
0 references
0 references
0 references
0 references
