A single-machine bi-criterion scheduling problem with two agents
Simple item page Statistics| Field | Value | Language |
|---|---|---|
dc.citation.epage |
10841 | en_US |
dc.citation.issue |
23 | en_US |
dc.citation.spage |
10831 | en_US |
dc.citation.volume |
219 | en_US |
dc.citation.woscount |
2 | |
dc.contributor.author |
Lee, Wen-Chiung | en_US |
dc.contributor.author |
Chung, Yu-Hsiang | en_US |
dc.contributor.author |
Huang, Zong-Ren | en_US |
dc.contributor.department |
工業工程與管理學系 | zh_TW |
dc.contributor.department |
Department of Industrial Engineering and Management | en_US |
dc.date.accessioned |
2014-12-08T15:31:04Z | |
dc.date.available |
2014-12-08T15:31:04Z | |
dc.date.issued |
2013-08-01 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.doi |
10.1016/j.amc.2013.05.025 | en_US |
dc.identifier.issn |
0096-3003 | en_US |
dc.identifier.journal |
APPLIED MATHEMATICS AND COMPUTATION | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1016/j.amc.2013.05.025 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/22151 | |
dc.identifier.wosnumber |
WOS:000321941200001 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Scheduling | en_US |
dc.subject |
Total completion time | en_US |
dc.subject |
Maximum tardiness | en_US |
dc.subject |
Two-agent | en_US |
dc.subject |
Single-machine | en_US |
dc.title |
A single-machine bi-criterion scheduling problem with two agents | en_US |
dc.type |
Article | en_US |
Files
- 000321941200001.pdf (303.2 KB, Adobe PDF)
Collections: Articles