SEMI-ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON THREE SPECIAL UNIFORM MACHINES (Q5315986): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0217595905000558 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2163575977 / rank | |||
Normal rank | |||
Latest revision as of 08:28, 30 July 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
