Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times (Q626449): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57185701, #quickstatements; #temporary_batch_1711439739529 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4223058 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Semi on-line scheduling on two identical machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel machine scheduling under a grade of service provision / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Online scheduling on parallel machines with two goS levels / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal online algorithms for scheduling on two identical machines under a grade of service / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Online and semi-online scheduling of two machines under a grade of service provision / rank | |||
Normal rank | |||
Latest revision as of 18:30, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times |
scientific article |
Statements
Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times (English)
0 references
18 February 2011
0 references
makespan
0 references
competitive analysis
0 references
total processing time
0 references
0 references
