3 research outputs found

    BOZULMA ETKİLİ VE TEK BAKIM EKİPLİ BAKIM ÇİZELGELEME PROBLEMİ İÇİN BİR MATEMATİKSEL MODEL

    Get PDF
    Karmaşıklığı arttırması nedeniyle makine çizelgeleme literatüründe genellikle, bakım ve kaynak kısıtları göz ardı edilmekte ya da sadece birisi dikkate alınmaktadır. Ancak özellikle bakım sırasında kaynak ihtiyacının oluştuğu durumlarda bu iki kısıt grubunun birlikte ele alınması kritiktir. Bu çalışmada ilişkisiz paralel makine çizelgeleme problemi, bakım ve kaynak kısıtları altında ele alınmıştır. Ele alınan problemde bakım, bir zaman penceresi içinde gerçekleştirilmelidir ve süresi, bakım zamanına bağlı olarak bozulmaktadır. Bu problemin çözümü için bir matematiksel model önerilmiştir. Önerilen modelin hangi boyuta kadar çözülebildiğini analiz edebilmek amacıyla rassal türetilen test problemleri kullanılmıştır. Önerilen model ile en fazla 25 işli problemlerin çözümlerini elde edebilmek mümkün olabilmiştir

    Joint optimization of production and maintenance scheduling for unrelated parallel machine using hybrid discrete spider monkey optimization algorithm

    Get PDF
    This paper considers an unrelated parallel machine scheduling problem with variable maintenance based on machine reliability to minimize the maximum completion time. To obtain the optimal solution of small-scale problems, we firstly establish a mixed integer programming model. To solve the medium and large-scale problems efficiently and effectively, we develop a hybrid discrete spider monkey optimization algorithm (HDSMO), which combines discrete spider monkey optimization (DSMO) with genetic algorithm (GA). A few additional features are embedded in the HDSMO: a three-phase constructive heuristic is proposed to generate better initial solution, and an individual updating method considering the inertia weight is used to balance the exploration and exploitation capabilities. Moreover, a problem-oriented neighborhood search method is designed to improve the search efficiency. Experiments are conducted on a set of randomly generated instances. The performance of the proposed HDSMO algorithm is investigated and compared with that of other existing algorithms. The detailed results show that the proposed HDSMO algorithm can obtain significantly better solutions than the DSMO and GA algorithms

    An integrated three-stage maintenance scheduling model for unrelated parallel machines with aging effect and multi-maintenance activities

    No full text
    We propose an integrated three-stage model for maintenance scheduling of unrelated parallel machines (UPMs) with aging effect and multi-maintenance activities (AEMMAs) using a variety of MODM techniques such as the fuzzy analytic hierarchy process (AHP), the technique for order of preference by similarity to ideal solution (TOPSIS), and goal programming (GP). We use fuzzy AHP in the first stage of the proposed model to account for the inherent ambiguity and vagueness in real-life maintenance scheduling problems. In the second stage, we use TOPSIS to reduce the multi-objective problem into an efficient bi-objective problem. Finally, we use GP to solve the resulting bi-objective problem and develop an optimal maintenance schedule in the third stage of the model. We use a numerical example to demonstrate the applicability of the proposed approach and exhibit the efficacy of the procedures and algorithms
    corecore