A note on LPT scheduling (Q5906502): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Worst-case analysis of heuristics for open shops with parallel machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4099211 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: `` Strong '' NP-Completeness Results / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-6377(93)90024-b / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1987426319 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:08, 30 July 2024
scientific article; zbMATH DE number 550416
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on LPT scheduling |
scientific article; zbMATH DE number 550416 |
Statements
A note on LPT scheduling (English)
0 references
12 April 1994
0 references
identical parallel machines
0 references
heuristics
0 references
worst-case performance
0 references
largest processing-time-first
0 references
parallel-machine scheduling
0 references