MCAA PLANS OPEN-SHOP OFFENSIVE

被引：0

|

作者：

不详

机构：

来源：

ENGINEERING NEWS-RECORD | 1984年 / 212卷 / 07期

关键词：

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

引用

收藏

页码：46 / 47

页数：2

相关论文

共 50 条

[41] Classical and new heuristics for the open-shop problem: A computational evaluation
Gueret, C
Prins, C
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 107 (02) : 306 - 314
[42] OPEN-SHOP SCHEDULING WITH RELEASE DATES TO MINIMIZE MAXIMUM LATENESS
KELLERER, H
TAUTENHAHN, T
WOEGINGER, G
NAVAL RESEARCH LOGISTICS, 1995, 42 (01) : 141 - 145
[43] Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays
Peter Brucker
Sigrid Knust
T.C. Edwin Cheng
Natalia V. Shakhlevich
Annals of Operations Research, 2004, 129 : 81 - 106
[44] Heuristic approach to the total tardiness in nonpreemtive open-shop scheduling
International Journal of Industrial Engineering - Applications and Practice, 1995, 2 (01):
[45] DUAL CRITERIA PREEMPTIVE OPEN-SHOP PROBLEMS WITH MINIMUM MAKESPAN
VAIRAKTARAKIS, G
SAHNI, S
NAVAL RESEARCH LOGISTICS, 1995, 42 (01) : 103 - 121
[46] Polynomial time approximation algorithms for proportionate open-shop scheduling
Naderi, B.
Zandieh, M.
Yazdani, M.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2014, 21 (06) : 1031 - 1044
[47] Health and safety training in a sample of open-shop construction companies
Goldenhar, LM
Moran, SK
Colligan, M
JOURNAL OF SAFETY RESEARCH, 2001, 32 (02) : 237 - 252
[48] Four decades of research on the open-shop scheduling problem to minimize the makespan
Ahmadian, Mohammad Mahdi
Khatami, Mostafa
Salehipour, Amir
Cheng, T. C. E.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 295 (02) : 399 - 426
[49] A POLYNOMIAL-TIME OPEN-SHOP PROBLEM WITH AN ARBITRARY NUMBER OF MACHINES
SEVASTYANOV, SV
CYBERNETICS AND SYSTEMS ANALYSIS, 1992, 28 (06) : 918 - 933
[50] Two-machine open-shop scheduling with rejection to minimize the makespan
Liqi Zhang
Lingfa Lu
Jinjiang Yuan
OR Spectrum, 2016, 38 : 519 - 529

← 1 2 3 4 5 →