ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES (Q3063612): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4223058 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On-line scheduling of parallel jobs on two machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling parallel jobs to minimize the makespan / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Online scheduling of parallel jobs on two machines is 2-competitive / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank | |||
Normal rank | |||
Revision as of 14:30, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES |
scientific article |
Statements
ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES (English)
0 references
15 December 2010
0 references
online scheduling
0 references
makespan
0 references
competitive analysis
0 references
bounded processing time
0 references
