Efficient bi-objective ant colony approach to minimize total tardiness and system unavailability for a parallel machine scheduling problem

被引:3
|
作者
Ali Berrichi
Farouk Yalaoui
机构
[1] University of M’hamed Bougara of Boumerdes,LIMOSE, Computer Science Department
[2] University of Technology of Troyes,Charles Delaunay Institute, LOSI, UMR STMR 6279
关键词
Production scheduling; Preventive maintenance (PM); Reliability; Total tardiness; Multi-objective optimization; Ant colony;
D O I
暂无
中图分类号
学科分类号
摘要
In recent years, decision makers give more importance to the maintenance function, viewing its substantial contribution to business productivity. However, most literature on scheduling studies does not take into account maintenance 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 maintenance actions in production planning elongates the achievement dates of orders and affects deadlines. In this paper, we propose a bi-objective model to deal with production scheduling 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 study.
引用
收藏
页码:2295 / 2310
页数:15
相关论文
共 50 条
  • [2] Efficient bi-objective ant colony approach to minimize total tardiness and system unavailability for a parallel machine scheduling problem
    Berrichi, Ali
    Yalaoui, Farouk
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 68 (9-12): : 2295 - 2310
  • [3] Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm
    Khoudi, Asmaa
    Berrichi, Ali
    [J]. OPERATIONAL RESEARCH, 2020, 20 (03) : 1763 - 1789
  • [4] Minimize total tardiness and machine unavailability on single machine scheduling problem: bi-objective branch and bound algorithm
    Asmaa Khoudi
    Ali Berrichi
    [J]. Operational Research, 2020, 20 : 1763 - 1789
  • [5] A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness
    Chen, Lu
    Yang, Wenhui
    Qiu, Kejun
    Dauzere-Peres, Stephane
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2023, 155
  • [6] Scheduling unrelated parallel machine to minimize total weighted tardiness using ant colony optimization
    Zhou, Hong
    Li, Zhengdao
    Wu, Xuejing
    [J]. 2007 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION AND LOGISTICS, VOLS 1-6, 2007, : 132 - 136
  • [7] Bi-objective identical parallel machine scheduling to minimize total energy consumption and makespan
    Wang, Shijin
    Wang, Xiaodong
    Yu, Jianbo
    Ma, Shuan
    Liu, Ming
    [J]. JOURNAL OF CLEANER PRODUCTION, 2018, 193 : 424 - 440
  • [8] An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption
    Yuksel, Damla
    Tasgetiren, M. Fatih
    Kandiller, Levent
    Gao, Liang
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 145
  • [9] Parallel machine scheduling to minimize total tardiness
    Yalaoui, F
    Chu, CB
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2002, 76 (03) : 265 - 279
  • [10] A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
    Cordone, Roberto
    Hosteins, Pierre
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 102 : 130 - 140