Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (Q2693572): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:57, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines |
scientific article |
Statements
Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines (English)
0 references
24 March 2023
0 references
scheduling
0 references
uniform parallel batch machines
0 references
processing set restrictions
0 references
equal job lengths
0 references
exact algorithms
0 references
