Scheduling equal-length jobs on identical parallel machines (Q1570817): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4859840 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling identical jobs on uniform parallel machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4055377 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines / rank | |||
Normal rank |
Revision as of 10:58, 30 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Scheduling equal-length jobs on identical parallel machines |
scientific article |
Statements
Scheduling equal-length jobs on identical parallel machines (English)
0 references
11 July 2000
0 references
dynamic programming
0 references
parallel machine scheduling
0 references
weighted sum of completion times
0 references
total tardiness
0 references