標題: A single-machine bi-criterion scheduling problem with two agents
作者: Lee, Wen-Chiung
Chung, Yu-Hsiang
Huang, Zong-Ren
工業工程與管理學系
Department of Industrial Engineering and Management
關鍵字: Scheduling;Total completion time;Maximum tardiness;Two-agent;Single-machine
公開日期: 1-Aug-2013
摘要: 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.
URI: http://dx.doi.org/10.1016/j.amc.2013.05.025
http://hdl.handle.net/11536/22151
ISSN: 0096-3003
DOI: 10.1016/j.amc.2013.05.025
期刊: APPLIED MATHEMATICS AND COMPUTATION
Volume: 219
Issue: 23
起始頁: 10831
結束頁: 10841
Appears in Collections:Articles


Files in This Item:

  1. 000321941200001.pdf