A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem (Q1869904)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1902976
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem |
scientific article; zbMATH DE number 1902976 |
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
0.8910040855407715
0 references
0.866982638835907
0 references
0.8375266790390015
0 references
0.8352636098861694
0 references
0.8306034207344055
0 references
