A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (Q337146): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2014.06.014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063910010 / rank | |||
Normal rank | |||
Revision as of 21:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan |
scientific article |
Statements
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (English)
0 references
10 November 2016
0 references
scheduling
0 references
flow shop
0 references
online
0 references
competitive ratio
0 references
