MCAA PLANS OPEN-SHOP OFFENSIVE

被引：0
|
作者：
不详
机构：
来源：
ENGINEERING NEWS-RECORD | 1984年 / 212卷 / 07期
关键词：
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
引用
收藏
页码：46 / 47
页数：2
相关论文
共 50 条
  • [21] PHILLY TRADES MUST PAY IN OPEN-SHOP DISPUTE
    不详
    ENGINEERING NEWS-RECORD, 1985, 214 (07): : 113 - 113
  • [22] THE ORIGINS OF THE OPEN-SHOP MOVEMENT, 1919-1920
    WAKSTEIN, AM
    JOURNAL OF AMERICAN HISTORY, 1964, 51 (03) : 460 - 475
  • [23] The routing open-shop problem on a network: Complexity and approximation
    Averbakh, Igor
    Berman, Oded
    Chernykh, Ilya
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (02) : 531 - 539
  • [24] ABC TELEPHONE HOTLINE OFFERS OPEN-SHOP ADVICE
    不详
    ENGINEERING NEWS-RECORD, 1984, 212 (21): : 52 - 52
  • [25] An optimal constraint programming approach to the open-shop problem
    Malapert, Arnaud
    Guéret, Christelle
    Cambazard, Hadrien
    Jussien, Narendra
    Langevin, André
    Rousseau, Louis-Martin
    ICAPS 2013 - Proceedings of the 23rd International Conference on Automated Planning and Scheduling, 2013, : 478 - 479
  • [26] Adaptive Open-Shop Scheduling for Optical Interconnection Networks
    Dung Pham Van
    Fiorani, Matteo
    Wosinska, Lena
    Chen, Jiajia
    JOURNAL OF LIGHTWAVE TECHNOLOGY, 2017, 35 (13) : 2503 - 2513
  • [27] Optimal Constraint Programming Approach to the Open-Shop Problem
    Malapert, Arnaud
    Cambazard, Hadrien
    Gueret, Christelle
    Jussien, Narendra
    Langevin, Andre
    Rousseau, Louis-Martin
    INFORMS JOURNAL ON COMPUTING, 2012, 24 (02) : 228 - 244
  • [28] Competitive genetic algorithms for the open-shop scheduling problem
    Christian Prins
    Mathematical Methods of Operations Research, 2000, 52 : 389 - 411
  • [29] A position-based propagator for the open-shop problem
    Monette, Jean-Noel
    Deville, Yves
    Dupont, Pierre
    INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING FOR COMBINATORIAL OPTIMIZATION PROBLEMS, PROCEEDINGS, 2007, 4510 : 186 - +
  • [30] Competitive genetic algorithms for the open-shop scheduling problem
    Prins, C
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2000, 52 (03) : 389 - 411
12345