Browsing by Author "Yalaoui, Farouk"
Now showing 1 - 4 of 4
- Results Per Page
- Sort Options
Item Efficient bi-objective ant colony approach to minimize total tardiness and system unavailability for a parallel machine scheduling problem(Springer, 2013) Berrichi, Ali; Yalaoui, FaroukIn recent years, decision makers give more im- portance to the maintenance function, viewing its substantial contribution to business productivity. However, most litera- ture on scheduling studies does not take into account main- tenance planning when implementing production schedules. The achievement of production plan without taking into account maintenance activities increases the probability of machine breakdowns, and inversely, considering mainte- nance actions in production planning elongates the achieve- ment dates of orders and affects deadlines. In this paper, we propose a bi-objective model to deal with production sched- uling and maintenance planning problems simultaneously. The performance criteria considered for production and maintenance are, respectively, the total tardiness and the unavailability of the production system. The start times of preventive maintenance actions and their number are not fixed in advance but considered, with the execution dates of production tasks, as decisions variables of the problem. The solution of the integrated model is based on multi-objective ant colony optimization approach. The proposed algorithm (Pareto ant colony optimization) is compared, on the basis of several metrics, with well-known multi-objective genetic algorithms, namely NSGA-II and SPEA 2, and a hybrid particle swarm optimization algorithm. Interesting results are obtained via empirical studyItem Fuzzy rules for joint integration of production schedule and maintenance planning(Old City Publishing, 2016) Berrichi, Ali; Yalaoui, Farouk; Yalaoui, AliceItem Heuristics to maximize system availability on parallel machine scheduling problem(IEEE, 2015) Khoudi, Asmaa; Berrichi, Ali; Yalaoui, FaroukItem New conditions of dominance and optimality for single-machine scheduling problems with nested execution intervals(Inderscience Publishers, 2024) Ourari, Samia; Yalaoui, FaroukIn this paper, we consider the problem of scheduling a set of n + 1 jobs on a single disjunctive machine. Each job has a fixed processing time and a temporal execution interval. Pre-emption is not allowed. Temporal execution intervals are assumed to have a perfect pyramidal structure, i.e., the execution intervals of the jobs are nested within each other, or none two of them are contained within each other. The objective is to find a feasible sequence that minimises the maximum lateness under some particular constraints. In order to do so, new dominance properties under known necessary and sufficient conditions are established, and optimality conditions of certain job sequences are given.
