Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags (Q2018863)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags |
scientific article |
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
