Publications Internationales
Permanent URI for this collectionhttps://dspace.univ-boumerdes.dz/handle/123456789/13
Browse
3 results
Search Results
Item Branch and bound algorithm for identical parallel machine scheduling problem to maximise system availability(Inder Science, 2020) Khoudi, Asmaa; Berrichi, AliIn the majority of production scheduling studies, the objective is to minimise a criterion which is generally, function of completion times of production jobs. However, for some manufacturing systems, the reliability/availability of machines can be the most important performance criteria towards decision makers. In this paper, we deal with a production scheduling problem on identical parallel machines and the objective is to find the best assignment of jobs on machines maximising the system availability. We assume that the production system can be subject to potentially costly failures then PM actions are performed at the end of production jobs. We have proposed a branch and bound algorithm, dominance rules and an efficient upper bound to solve the proposed model optimally. Computational experiments are carried out on randomly generated test problems and results show the efficiency of the proposed upper bound and dominance rules. [Submitted 23 December 2016; Accepted 27 October 2018]Item Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm(Springer, 2018) Khoudi, Asmaa; Berrichi, AliThe joint production scheduling and preventive maintenance problems have recently attracted researchers’ attention given their contribution, both the production and the maintenance functions and their integration, to the firms’ efficiency. In this paper, we deal with production scheduling and preventive maintenance (PM) planning on single machine problem. The aim is to find an appropriate sequencing of production jobs and a PM planning to minimize two objectives simultaneously: total tardiness of jobs and machine unavailability. We propose a bi-objective exact algorithm, that we called BOBB, based on bi-objective branch and bound method to find the efficient set. We introduced several properties and bound sets to enhance the performance of the proposed BOBB algorithm. Furthermore, we propose a hybrid method, that we called GA-BBB, based on genetic algorithm and binary branch and bound algorithm to compute an approximate efficient set to be used as an initial upper bound set in the BOBB algorithm. An experimental study was conducted to show the efficiency of the GA-BBB and the BOBB algorithmsItem Minimize total tardiness and machine unavailability on single machine scheduling problem : bi-objective branch and bound algorithm(Springer, 2017) Khoudi, Asmaa; Berrichi, Ali