Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment

被引：42

作者：

Daniels, RL

Hua, SY ^{[1
]}

Webster, S

机构：

[1] Univ Wisconsin, Sch Business, Madison, WI 53706 USA

[2] Georgia Inst Technol, Sch Management, Atlanta, GA 30332 USA

[3] Syracuse Univ, Sch Management, Syracuse, NY 13244 USA

来源：

COMPUTERS & OPERATIONS RESEARCH | 1999年 / 26卷 / 02期

关键词：

production scheduling; flexible resource allocation; heuristics;

D O I：

10.1016/S0305-0548(98)00054-9

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper, we examine the parallel-machine flexible-resource scheduling problem in which job assignment to machines are not specified (UPMFRS). The UPMFPS problem is NP-hard, motivating the development of effective heuristics that approximately determine the job assignment to machines and the allocation of resources to jobs. The paper compares a decomposition heuristic and a tabu-search heuristic, and concludes that the tabu-search heuristic is cost and quality effective in locating the near-optimal solutions. (C) 1998 Elsevier Science Ltd. All rights reserved.

引用

页码：143 / 155

页数：13

共 24 条

[1] SCHEDULING ON MACHINES WITH VARIABLE SERVICE RATES [J].