Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940): 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/s10479-018-2775-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2794187668 / rank | |||
Normal rank | |||
Revision as of 19:23, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic |
scientific article |
Statements
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (English)
0 references
31 October 2018
0 references
scheduling
0 references
non-permutation flowshop
0 references
time lags
0 references
mathematical programming
0 references
heuristics
0 references
lexicographic optimization
0 references
