• Home
  • توالی عملیات
    • List of Articles توالی عملیات

      • Open Access Article

        1 - Algorithm of determining Product's Batch Size and Sequence of the Operations of n Job on m Machine
        رسول Haji هوشنگ Taghizadeh
        In this paper, a heuristic algorithm has been presented with the aim of determining the quantity ofa best batch size for minimizing the makespan of a production system in order to meet the demandsof a specified period for a product. This algorithm calculates the time re More
        In this paper, a heuristic algorithm has been presented with the aim of determining the quantity ofa best batch size for minimizing the makespan of a production system in order to meet the demandsof a specified period for a product. This algorithm calculates the time required for fulfilling each ofthe requisite operations for producing a batch size by taking into account the standard time forfulfilling the operations, number of similar parts used in one unit of a product, the machinery setuptime, scrap percentage of each operation on the relevant machinery and the quantity of that batchsize. This algorithm allots the requisite operations to the machinery for producing the total demandof a specified period by making use of the calculated information, SPT1 rule, the specifiedconditions in the algorithm and the quantity of the production in each batch size. Then, with respectto the quantity of this batch size, the aggregate of the setup and idle times of machinery iscalculated for the whole period. Afterwards, the quantity of the optimum batch size whichminimizes the aggregate of these times is obtained by calculating the aggregate of these times forthe different quantities of the batch sizes and comparing them. Some examples have been presentedfor comparing this algorithm with Ho & Chang, Johnson, and Palmer's algorithms. The results showthat this algorithm presents a better makespan in comparison with the aforementioned algorithms. Manuscript profile
      • Open Access Article

        2 - Setup times optimization with considering maintenance scheduling by using nonlinear modeling
        A. Zaretalab M.R. Shahryari S. Naderi
        The present paper, titled “optimizing the time of preparation, taking into account the timing of repair and maintenance using non-linear modeling”, has been implemented with the aim of designing and presenting a mathematical model to get the best sequence of More
        The present paper, titled “optimizing the time of preparation, taking into account the timing of repair and maintenance using non-linear modeling”, has been implemented with the aim of designing and presenting a mathematical model to get the best sequence of operations leading to minimum the total time of production. The main research question is related to the reduction of time and production costs following the implementation of the presented model. The method of research’s data and information collection, have been survey and study and library resources, referring to the documentations of repair, maintenance and production segments in the company and expert managers in the areas of planning, engineering production and … Following, the model taking into account the constraints of cost and time, as well as the limitations of the production system is presented. LINGO software is used to solve the models and model outputs, will provide the local solutions that would show the best sequence. And finally it can be extended the model to other industrial units with only smart alternations and present the best operational sequence related to multifunctional machines. Manuscript profile