New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs (Q1044141)
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: New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs |
scientific article; zbMATH DE number 5645179
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs |
scientific article; zbMATH DE number 5645179 |
Statements
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs (English)
0 references
10 December 2009
0 references
bicriteria scheduling
0 references
average flowtime
0 references
number of tardy jobs
0 references
beam search
0 references
0 references
0 references
0 references
0 references
0 references
0 references
