On-line scheduling of two-machine open shops where jobs arrive over time (Q1383798)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1139573
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On-line scheduling of two-machine open shops where jobs arrive over time |
scientific article; zbMATH DE number 1139573 |
Statements
On-line scheduling of two-machine open shops where jobs arrive over time (English)
0 references
13 April 1998
0 references
heuristic algorithm
0 references
worst-case guarantee
0 references
on-line scheduling
0 references
two-machine open shops
0 references
makespan
0 references
worst-case performance ratios
0 references
0.8759921789169312
0 references
0.856102466583252
0 references
