Clarification of lower bounds of two-machine flow-shop scheduling to minimize total late work
2018
The recent work of Chen et al. (2018) elaborates on the lower bound of Lin, Lin, and Lee (2006) concerning total late work minimization in two-machine flow-shop scheduling, denoted by F2||∑Yi or F2...
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
2
References
3
Citations
NaN
KQI