SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES (Q5315986): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The exact LPT-bound for maximizing the minimum completion time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The optimal on-line parallel machine scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ordinal on-line scheduling for maximizing the minimum machine completion time / 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: A polynomial-time approximation scheme for maximizing the minimum machine completion time / rank | |||
Normal rank | |||
Revision as of 15:17, 10 June 2024
scientific article; zbMATH DE number 2204315
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES |
scientific article; zbMATH DE number 2204315 |
Statements
SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES (English)
0 references
12 September 2005
0 references
Scheduling
0 references
semi-on-line
0 references
competitive ratio
0 references
