Abstract:The cutting processes of rebar stock in housing project cause a large amount of waste because of high variety between required rebar lengths and standard rebar lengths, this problem is called one dimensional cutting stock problem. This research aims to utilize the rebar stock and minimize the losses using integer linear programming approach-aided by Advanced Interactive Mathematical Modeling System (AIMMS) software for solving the problems. These one-dimensional cutting rebar stock problems are divided into 19-problem according to the variety in the rebar diameter (25 mm, 16 mm, 12 mm, and 10 mm), and the variety in the design of activities in that housing project. The losses that are produced for each activity are utilized in the next activity when the length of item losses is larger than the required small item lengths in next activity for the same rebar diameters. That makes the utilization is to be maximized, where the Utilization Stock Ratio is reached to (98.53%).

When short items are being cut out from long objects, the One-Dimensional Cutting Stock Problem (1D-CSP) is being appeared and caused increment in wastage material amounts, so the primary purpose of this paper is to use integer linear programming (ILP) based on Advance Interactive Mathematical Modeling System (AIMMS) software to minimize the trim losses which is resulting from one dimensional-long objects and also to reduce the total number of used stocks. Reinforcement Steel (Rebar) is used in building structure at Al-Aziziyah Housing Project by Al-Mansour Company as long objects with standard lengths and different diameters which are representing four problems according to these diameters (25 mm, 16 mm, 12 mm, and 10 mm). The implementation of that software is very effective to present optimal solutions, where the utilization stock ratio reached to (99.51%).

No abstract

Mixed-model assembly line has great importance because of its variability. This type of assembly line includes two important problems, the first is the mixed-model line balancing problem and the second is the model sequencing problem. The mixed-model line balancing problem is the problem of assigning tasks to stations in a way to get an effective performance measures, and the model sequencing problem is the problem of deciding the sequence in which different models should be released to the same assembly line. This paper focused on sequencing problem that dependent on the results of balancing problem. There are several methods could be used for solving the sequencing problem, we described the Goal chasing 1 method. This method is applied on the assembly plant of Electronic Industries Company (EIC) that assembles different models of automatic changeover (ACH) which is dependent on the results of (MMSLO) program with a heuristic balancing method.