A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem (Q1869904): 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/s0305-0548(01)00098-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059573430 / rank | |||
Normal rank | |||
Latest revision as of 10:31, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem |
scientific article |
Statements
A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem (English)
0 references
28 April 2003
0 references
Scheduling
0 references
two-stage assembly flowshop
0 references
branch and bound algorithm
0 references
total weighted flowtime scheduling
0 references
