A polynomial-time algorithm for a flow-shop batching problem with equal-length operations

Peter Brucker, Natalia V. Shakhlevich. A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. J. Scheduling, 14(4):371-389, 2011. [doi]

@article{BruckerS11a,
  title = {A polynomial-time algorithm for a flow-shop batching problem with equal-length operations},
  author = {Peter Brucker and Natalia V. Shakhlevich},
  year = {2011},
  doi = {10.1007/s10951-009-0150-8},
  url = {http://dx.doi.org/10.1007/s10951-009-0150-8},
  tags = {data-flow},
  researchr = {https://researchr.org/publication/BruckerS11a},
  cites = {0},
  citedby = {0},
  journal = {J. Scheduling},
  volume = {14},
  number = {4},
  pages = {371-389},
}