OPEN-SHOP MOVEMENT SLITHERS INTO CONSTRUCTION CONTRACTING

被引:0
|
作者
OLSEN, RN
机构
来源
CIVIL ENGINEERING | 1971年 / 41卷 / 11期
关键词
D O I
暂无
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
引用
收藏
页码:40 / &
相关论文
共 50 条
  • [41] Extended Genetic Algorithm for solving open-shop scheduling problem
    Hosseinabadi, Ali Asghar Rahmani
    Vahidi, Javad
    Saemi, Behzad
    Sangaiah, Arun Kumar
    Elhoseny, Mohamed
    SOFT COMPUTING, 2019, 23 (13) : 5099 - 5116
  • [42] Open-shop scheduling for unit jobs under precedence constraints
    Chen, Yong
    Goebel, Randy
    Lin, Guohui
    Su, Bing
    Zhang, An
    THEORETICAL COMPUTER SCIENCE, 2020, 803 : 144 - 151
  • [43] 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
  • [44] OPEN-SHOP SCHEDULING WITH RELEASE DATES TO MINIMIZE MAXIMUM LATENESS
    KELLERER, H
    TAUTENHAHN, T
    WOEGINGER, G
    NAVAL RESEARCH LOGISTICS, 1995, 42 (01) : 141 - 145
  • [45] 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
  • [46] Heuristic approach to the total tardiness in nonpreemtive open-shop scheduling
    International Journal of Industrial Engineering - Applications and Practice, 1995, 2 (01):
  • [47] DUAL CRITERIA PREEMPTIVE OPEN-SHOP PROBLEMS WITH MINIMUM MAKESPAN
    VAIRAKTARAKIS, G
    SAHNI, S
    NAVAL RESEARCH LOGISTICS, 1995, 42 (01) : 103 - 121
  • [48] 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
  • [50] 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