Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags (Q2018863): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-014-0761-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2008789329 / rank | |||
Normal rank | |||
Revision as of 20:49, 19 March 2024
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
