Given a set of h buildings to be torn down and rebuilt, each building Bi demands ni units of temporary vacancies for reconstruction (i.e. the reconstruction of Bi can be started only if there are at least ni temporary vacancies available) and returns a; units of vacancies when it is rebuilt. The reconstruction time of each building is assumed to be unitary. Under the initial provision of V0 units of vacancies and a specified due date d, ?Bi?Sai, where S is a feasible sequence such that |S| ? d, is the objective function to be maximized. We show that the problem is NP-complete
Relation:
International Journal of System Science 23(9):1433-1448
