Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System (Q3951534): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0603019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087547812 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4658190 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of Greedy Solutions for a Replacement Part Sequencing Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a Fleet Sizing and Allocation Problem / rank | |||
Normal rank | |||
Latest revision as of 16:21, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System |
scientific article |
Statements
Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System (English)
0 references
1982
0 references
independent tasks
0 references
identical processors
0 references
earliest processor finishing time
0 references
maintenance scheduling
0 references
deterministic fleet sizing
0 references
NP-hard
0 references
worst- case performance of the LPT algorithm
0 references
