Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost (Q2444843)
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: Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost |
scientific article; zbMATH DE number 6282897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost |
scientific article; zbMATH DE number 6282897 |
Statements
Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost (English)
0 references
11 April 2014
0 references
scheduling
0 references
online algorithms
0 references
total completion time
0 references
rejection
0 references
0 references
0 references
0 references
0.94132096
0 references
0 references
0.92019796
0 references
0.91697353
0 references
0.91573447
0 references
0.9004903
0 references
0.9004067
0 references
0.8988192
0 references
0.89812756
0 references
