Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:16, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch less, cut more and minimize the number of late equal-length jobs on identical machines |
scientific article |
Statements
Branch less, cut more and minimize the number of late equal-length jobs on identical machines (English)
0 references
7 January 2013
0 references
polynomial-time algorithm
0 references
solution tree
0 references
scheduling identical machines
0 references
