Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective

Bin Ji 0001, Dezhi Zhang, Samson S. Yu, Binqiao Zhang. Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective. European Journal of Operational Research, 288(1):47-62, 2021. [doi]

@article{JiZYZ21,
  title = {Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective},
  author = {Bin Ji 0001 and Dezhi Zhang and Samson S. Yu and Binqiao Zhang},
  year = {2021},
  doi = {10.1016/j.ejor.2020.05.035},
  url = {https://doi.org/10.1016/j.ejor.2020.05.035},
  researchr = {https://researchr.org/publication/JiZYZ21},
  cites = {0},
  citedby = {0},
  journal = {European Journal of Operational Research},
  volume = {288},
  number = {1},
  pages = {47-62},
}