.png){kind=icon}
返回
A single-machine bi-criterion scheduling problem with two agents
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2013.05.025.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The multiple-agent scheduling problems have received increasing attention recently. However, most of the research focuses on studying the computational complexity of the intractable cases or examining problems with a single criterion. Often a decision maker has to decide the schedule based on multiple criteria. In this paper, we consider a single machine problem where the objective is to minimize a linear combination of the total completion time and the maximum tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. We develop a branch-and-bound algorithm and several simulated annealing algorithms to search for the optimal solution and near-optimal solutions for the problem, respectively. Computational experiments show that the proposed branch-and-bound algorithm could solve problems of up to 24 jobs in a reasonable amount of time and the performance of the combined simulated annealing algorithm is very good with an average error percentage of less than 0.5% for all the tested cases. (C) 2013 Elsevier Inc. All rights reserved.
Keyword:
Scheduling
Total completion time
Maximum tardiness
Two-agent
Single-machine
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
Islamic finance and renewable energy: An innovative model for the sustainability of investments
PREAI
分享收藏分享收藏
查看更多内容