A branch and bound algorithm for minimizing weighted completion times with deadlines (Q3835632): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57634031, #quickstatements; #temporary_batch_1704695633138 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:23, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for minimizing weighted completion times with deadlines |
scientific article |
Statements
A branch and bound algorithm for minimizing weighted completion times with deadlines (English)
0 references
20 April 1995
0 references
one-machine scheduling
0 references
weighted sum of completion times
0 references
deadline
0 references
branch-and-bound
0 references
