A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (Q337146): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C60 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6650716 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
flow shop | |||
| Property / zbMATH Keywords: flow shop / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
online | |||
| Property / zbMATH Keywords: online / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
competitive ratio | |||
| Property / zbMATH Keywords: competitive ratio / rank | |||
Normal rank | |||
Revision as of 05:22, 28 June 2023
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
