期刊
PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE
卷 224, 期 B7, 页码 1119-1131出版社
SAGE PUBLICATIONS LTD
DOI: 10.1243/09544054JEM1746
关键词
scheduling; rejection cost; Pareto simulated annealing; colonial competitive algorithm; performance measure; Pareto set
资金
- Iranian National Science Foundation [87041515]
The present paper considers the problem of scheduling a set of jobs where some jobs may be rejected. The objective function consists of minimizing two criteria simultaneously: the sum of the weighted completion times of the accepted jobs and the sum of the rejection costs. Although the characteristics of this problem have been discussed in the literature, no solution algorithm has yet been proposed. Herein, solution algorithms are developed using two meta-heuristic methods: Pareto simulated annealing (PSA), a multiple-objective optimization approach; and colonial competitive algorithm (CCA), a novel method which is adopted for the first time in a discrete multiple-objective optimization problem. Computational testing illustrates the practicality of both algorithms to find a good estimation of the Pareto optimal set. The quality of the proposed algorithms are evaluated and compared by some available performance measures and a new measure introduced in the paper. The comparative results show that CCA offers better estimation of the Pareto optimal set than PSA.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据