A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2011.06.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2011.06.003 / rank | |||
Normal rank | |||
Latest revision as of 09:09, 11 December 2024
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
