A branch and bound algorithm for minimizing weighted completion times with deadlines (Q3835632): 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.1080/02331939308843913 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069989525 / rank | |||
Normal rank | |||
Revision as of 01:59, 20 March 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
