Scheduling jobs on a single machine to maximize the total revenue of jobs (Q954056)
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: Scheduling jobs on a single machine to maximize the total revenue of jobs |
scientific article; zbMATH DE number 5363318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling jobs on a single machine to maximize the total revenue of jobs |
scientific article; zbMATH DE number 5363318 |
Statements
Scheduling jobs on a single machine to maximize the total revenue of jobs (English)
0 references
7 November 2008
0 references
scheduling
0 references
single machine
0 references
total revenue
0 references
branch-and-bound algorithm
0 references
0 references
0 references
0 references
0.8172321915626526
0 references
0.7580327987670898
0 references
0.7558740377426147
0 references
0.7515353560447693
0 references
0.7446542382240295
0 references
