Quantitative data Distance-based objective Input: From-to chart Algorithms:Ĭonstruction and improvement algorithm Distance-based and adjacency-based objective Departments are in bands (2 or 3 bands), but the band Input data Qualitative data Adjacency-based objective Input: Relationship chart Algorithms: MCRAFT is not as effective in treating fixed departments and obstacles (they can get shifted)
The initial layout cannot be captured accurately unless the departments are already arranged in bandsīand width is assumed to be the same for all the bands Weaknesses: Facility shape is a restriction Increases exponentially with the number of departments Allows multi-floor layout planning Rectangular cells can be formed) More exchange alternatives. MCRAFT - Comments Strengths: Unlike the CRAFT algorithm, it does not restrict theĮxchange to the adjacent cells Smoother shapes compared to CRAFT (in most cases MCRAFT - Example A facility with the layout below has 5 departments. MCRAFT - Example Same problem data as in the CRAFT example REPEAT 3 and 4 until no improvement can be made.6 If any improving exchange is selected, then the two departments are swapped using a shifting procedure of the other departments.ĥ. Not necessarily limited to adjacent or equal-size departments!!Ĥ. A swap/exchange selection procedure similar to that of CRAFT is implemented. Based on this vector, it locates the departments following the serpentine flow directionsģ. After the band width is set, MCRAFT requires a vector (the sequence) of the departments in the initial layout. MCRAFT requires the user to specify Facility dimensions (rectangular, width x length) Number of bandsĢ. Otherwise the next row in the building is used to locate the rest of the department (the remaining cells) or the next department in the sequence.
If there is a space on the immediate right of the first department, next department in the sequence is placed. First department in the sequence is placed in the top-left corner. In each iteration, cells are formed starting from the top-left corner. MCRAFT Sweep pattern Layout is specified by a sequence of departments Move departments while two departments are being exchanged Shifts automatically other departments when unequal or non-adjacent departments are being exchanged Incrementally improving an initial block layoutĬonstruction algorithm Improvement algorithmĪn algorithm evolved from CRAFT allowing non-adjacent exchanges Building a block layout by iteratively adding departments
0 kommentar(er)
