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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2011.06.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1995270512 / rank | |||
Normal rank | |||
Revision as of 14:30, 19 March 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
