2 MACHINE OPEN SHOP SCHEDULING PROBLEM TO MINIMIZE AN ARBITRARY MACHINE USAGE REGULAR PENALTY-FUNCTION

被引：9

作者：

SHAKHLEVICH, NV

STRUSEVICH, VA

机构：

[1] ERASMUS UNIV ROTTERDAM, POB 1738, 3000 DR ROTTERDAM, NETHERLANDS

[2] BYELORUSSIAN ACAD SCI, INST ENGN CYBERNET, MINSK 220012, BELARUS

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1993年 / 70卷 / 03期

关键词：

OPEN SHOP SCHEDULING; MACHINE USAGE PENALTY FUNCTION; LINEAR-TIME ALGORITHM;

D O I：

10.1016/0377-2217(93)90250-Q

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The paper present a linear-time algorithm for solving the two machine open shop scheduling problem to minimize an arbitrary regular penalty function depending on the lengths of periods during which the machines are used. Both the preemptive and the nonpreemptive cases of the problem are considered.

引用

页码：391 / 404

页数：14

共 12 条

[1]

AKERS SB, 1955, OPER RES, V3, P429

[2] AN EFFICIENT ALGORITHM FOR THE JOB-SHOP PROBLEM WITH 2 JOBS [J].