Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032)
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 5843705
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration |
scientific article; zbMATH DE number 5843705 |
Statements
Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (English)
0 references
2 February 2011
0 references
scheduling
0 references
flow shop
0 references
simple linear deterioration
0 references
total weighted completion time
0 references
branch-and-bound algorithm
0 references
heuristic algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9378145
0 references
0.9188328
0 references
0.91875625
0 references
0.9185982
0 references
0.91395414
0 references
0.91288036
0 references
0.9128802
0 references
0.91248924
0 references
0 references
