A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness (Q4297161)
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: A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness |
scientific article; zbMATH DE number 597435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness |
scientific article; zbMATH DE number 597435 |
Statements
A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness (English)
0 references
8 August 1994
0 references
bicriterion scheduling
0 references
squared flowtime
0 references
maximum tardiness
0 references
branch-and- bound
0 references
0 references
0 references
0.8975770473480225
0 references
0.8305814266204834
0 references
0.8295149803161621
0 references
0.8110310435295105
0 references
0.8032518625259399
0 references
