.png){kind=icon}
返回
A Discrete Chimp Optimization Algorithm for Minimizing Tardy/Lost Penalties on a Single Machine Scheduling Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/ACCESS.2022.3174484.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Tardy/Lost (TL) penalties scheduling is a discrete optimization problem. TL scheduling problem is an NP-hard problem. As a result, proposing an optimization algorithm to handle this problem is critical. In a TL problem, a given set of jobs is scheduled on a single machine with common due dates to minimize the total penalties for tardiness jobs. The job will be lost and a certain penalty will be imposed if the tardiness of it exceeds a specific value. This paper proposes a novel improved version of the newly proposed chimp optimization algorithm (ChOA) for not only the TL problem but also, other discrete optimization problems. The proposed algorithm is named a discrete chimp optimization algorithm (DChOA). As far as we know, this is the first paper to solve the TL scheduling problem with a meta-heuristic algorithm. In DChOA, the original parameters and operators are modified and improved, and also a new swap operator is invoked to solve the TL problem. We compare the proposed DChOA with various well-known meta-heuristic algorithms as the genetic algorithm (GA), particle swarm optimization (PSO), grey wolf optimization (GWO), and crow search algorithm (CSA). Moreover, it compared against the MTLR (Minimum Tardy/Lost Ratio) heuristic algorithm in the literatures to verify its efficiency. Based on the experimental results, the DChOA outperformed the other algorithms and proved its superiority in obtaining near optimal solutions in most instance sizes of jobs.
Keyword:
Approximation algorithms
Heuristic algorithms
Schedules
Single machine scheduling
Mathematical models
Genetic algorithms
Optimal scheduling
Chimp optimization algorithm (ChOA)
scheduling problems
Tardy
Lost penalty
meta-heuristic algorithms
swap operator
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏Single machine scheduling to minimize total weighted late work: a comparison of scheduling rules and search algorithms最小化总加权延迟工作的单机调度: 调度规则和搜索算法的比较
PREAI
分享收藏A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm一种求解约束工程优化问题的元启发式方法: 乌鸦搜索算法
PREAI
分享收藏
查看更多内容