A branch and bound algorithm for minimizing weighted completion times with deadlines (Q3835632): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3320091 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimizing Weighted Completion Times with Deadlines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for single machine sequencing with deadlines to minimize total weighted completion time / rank | |||
Normal rank | |||
Latest revision as of 13:10, 23 May 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
0 references
0 references
