On relocation problems with multiple identical working crews

@article{Kononov2006OnRP,
  title={On relocation problems with multiple identical working crews},
  author={Alexander V. Kononov and Bertrand M. T. Lin},
  journal={Discrete Optimization},
  year={2006},
  volume={3},
  pages={366-381}
}
The relocation problem was formulated from a public housing project. In its basic form, a set of buildings needed to be torn down and erected by a single working crew. Given a fixed budget, the relocation problem seeks to determine a feasible reconstruction sequence of the old buildings. This problem has been shown to be mathematically equivalent to the classical two-machine flowshop of makespan minimization. In this paper, we consider a variant where multiple working crews are available for… CONTINUE READING