A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size (Q398896)
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 6331189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size |
scientific article; zbMATH DE number 6331189 |
Statements
A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size (English)
0 references
18 August 2014
0 references
two-machine flow-shop
0 references
serial batching
0 references
bounded batch size
0 references
makespan
0 references
batching cost
0 references
0 references
0.8751387000083923
0 references
0.8353204131126404
0 references
0.8296517133712769
0 references
0.828682541847229
0 references
0.8276686668395996
0 references
