A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063)
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 algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals |
scientific article |
Statements
A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (English)
0 references
15 November 2012
0 references
branch and bound algorithm
0 references
dynamic arrivals
0 references
batch scheduling
0 references
incompatible job families
0 references
0 references
0 references
0 references
0 references
