A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch and bound to minimize the number of late jobs on a single machine with release time constraints |
scientific article; zbMATH DE number 1902789
| 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; zbMATH DE number 1902789 |
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
0.9402504
0 references
0.9339967
0 references
0.9185054
0 references
0.9171957
0 references
0.9136392
0 references
0.9057956
0 references
0.90227246
0 references
