Minimizing the number of machines for scheduling jobs with equal processing times (Q1042179): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57633887, #quickstatements; #temporary_batch_1712443714953 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Scheduling jobs with equal processing times and time windows on identical parallel machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3236250 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the minimum number of processors for scheduling problems with communication delays / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs / rank | |||
Normal rank | |||
Latest revision as of 05:47, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing the number of machines for scheduling jobs with equal processing times |
scientific article |
Statements
Minimizing the number of machines for scheduling jobs with equal processing times (English)
0 references
7 December 2009
0 references
parallel machine scheduling
0 references
linear programming
0 references
0 references
