Bicriteria scheduling problem for unrelated parallel machines with release dates

被引:8
|
作者
Lin, Yang-Kuei [1 ]
Lin, Hao-Chen [1 ]
机构
[1] Feng Chia Univ, Dept Ind Engn & Syst Management, Taichung 40724, Taiwan
关键词
Scheduling; Bicriteria; Unrelated parallel machines; Release dates; Tabu search algorithm; POPULATION GENETIC ALGORITHM; MINIMIZING MAKESPAN SUBJECT; TOTAL FLOW-TIME; SETUP TIMES; OPTIMIZATION; MINIMIZATION; FORMULATION; JOBS;
D O I
10.1016/j.cor.2015.04.025
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This research proposes a heuristic and a tabu search algorithm (TSA) to find non-dominated solutions to bicriteria unrelated parallel machine scheduling problems with release dates. The two objective functions considered in this problem are to minimize both makespan and total weighted tardiness. The computational results show that the proposed heuristic is computationally efficient and provides solutions of reasonable quality. The proposed TSA outperforms other algorithms in terms of the number of non-dominated solutions and the quality of its solutions. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:28 / 39
页数:12
相关论文
共 50 条