Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Branch less, cut more and minimize the number of late equal-length jobs on identical machines |
scientific article; zbMATH DE number 6122475
| 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; zbMATH DE number 6122475 |
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
0 references
0 references
0 references
0 references
