Branch less, cut more and minimize the number of late equal-length jobs on identical machines (Q1929241): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077843589 / rank | |||
Normal rank | |||
Revision as of 21:52, 19 March 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
