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
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0377-2217(01)00353-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2055770719 / rank | |||
Normal rank | |||
Latest revision as of 12:11, 30 July 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
0 references
0 references
0 references
0 references
