AN EFFICIENT ALGORITHM FOR A JOB-SHOP PROBLEM

被引：5

作者：

KUBIAK, W

SETHI, S

SRISKANDARAJAH, C

机构：

[1] MEM UNIV NEWFOUNDLAND,FAC BUSINESS ADM,ST JOHNS,NF,CANADA

[2] UNIV TORONTO,FAC MANAGEMENT,TORONTO,ON,CANADA

[3] UNIV TORONTO,DEPT IND ENGN,TORONTO,ON,CANADA

来源：

ANNALS OF OPERATIONS RESEARCH | 1995年 / 57卷

关键词：

D O I：

10.1007/BF02099698

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We study the problem of minimizing makespan in a two-machine job shop with unit processing time operations. An efficient algorithm with respect to a succinct encoding of the problem instances is proposed. The algorithm is an improvement of earlier algorithms proposed for the problem by Brucker [1,2], Hefetz and Adiri [7], and Timkovskiy [15]. The idea behind the algorithm has the potential of extension to job shops with parallel machines.

引用

页码：203 / 216

页数：14

共 17 条

[1] MINIMIZING MAXIMUM LATENESS IN A 2-MACHINE UNIT-TIME JOB SHOP [J].