Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags (Q2018863)
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: Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags |
scientific article; zbMATH DE number 6419582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags |
scientific article; zbMATH DE number 6419582 |
Statements
Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags (English)
0 references
25 March 2015
0 references
scheduling
0 references
permutation flowshop
0 references
time lags
0 references
upper bounds
0 references
lower bounds
0 references
0 references
0 references
0 references
