A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:42, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound to minimize the number of late jobs on a single machine with release time constraints |
scientific article |
Statements
A branch and bound to minimize the number of late jobs on a single machine with release time constraints (English)
0 references
28 April 2003
0 references
Single machine scheduling
0 references
number of late jobs
0 references
branch and bound
0 references
dominance properties
0 references
elimination rules
0 references
