A parallel-machine scheduling problem with two competing agents

被引：19

作者：

Lee, Wen-Chiung ^{[1
]}

Chung, Yu-Hsiang ^{[1
]}

Wang, Jen-Ya ^{[2
]}

机构：

[1] Feng Chia Univ, Dept Stat, Taichung, Taiwan

[2] Hungkuang Univ, Dept Comp Sci & Informat Management, Taichung, Taiwan

来源：

ENGINEERING OPTIMIZATION | 2017年 / 49卷 / 06期

关键词：

Scheduling; total completion time; two-agent problem; parallel-machine problem; maximum tardiness; TOTAL COMPLETION-TIME; OPTIMIZATION PROBLEMS; GENETIC ALGORITHMS; MAXIMUM TARDINESS; RELEASE TIMES; MINIMIZE; EARLINESS; PENALTIES; SUBJECT; MODEL;

D O I：

10.1080/0305215X.2016.1227615

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

Scheduling with two competing agents has become popular in recent years. Most of the research has focused on single-machine problems. This article considers a parallel-machine problem, the objective of which is to minimize the total completion time of jobs from the first agent given that the maximum tardiness of jobs from the second agent cannot exceed an upper bound. The NP-hardness of this problem is also examined. A genetic algorithm equipped with local search is proposed to search for the near-optimal solution. Computational experiments are conducted to evaluate the proposed genetic algorithm.

引用

页码：962 / 975

页数：14

共 40 条

[1] An adaptive parameter binary-real coded genetic algorithm for constraint optimization problems: Performance analysis and estimation of optimal control parameters [J].