Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:17, 1 February 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
