An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system (Q4354087)
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: An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system |
scientific article; zbMATH DE number 1060108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system |
scientific article; zbMATH DE number 1060108 |
Statements
An algorithm to minimize total flowtime and maximum job lateness in the two-machine flowshop system (English)
0 references
23 April 1998
0 references
minimizing flowtime
0 references
maximum lateness of jobs
0 references
two-machine flowshop system
0 references
branch-and-bound
0 references
0 references
0.8939758539199829
0 references
0.8905444145202637
0 references
0.8713469505310059
0 references
0.8701993227005005
0 references
