ON MINIMIZING THE EXPECTED MAKESPAN AND FLOW TIME IN STOCHASTIC FLOW SHOPS WITH BLOCKING

被引：4
|
作者：
WIE, SH [1 ]
PINEDO, M [1 ]
机构：
[1] COLUMBIA UNIV,DEPT IND ENGN & OPERAT RES,NEW YORK,NY 10027
来源：
MATHEMATICS OF OPERATIONS RESEARCH | 1986年 / 11卷 / 02期
关键词：
D O I：
10.1287/moor.11.2.336
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
引用
下载
收藏
页码：336 / 342
页数：7
相关论文
共 50 条
  • [41] Two-machine stochastic flow shops with blocking and the traveling salesman problem
    Kalczynski, PJ
    Kamburowski, J
    JOURNAL OF SCHEDULING, 2005, 8 (06) : 529 - 536
  • [42] Minimizing makespan in no-wait job shops
    Bansal, N
    Mahdian, M
    Sviridenko, M
    MATHEMATICS OF OPERATIONS RESEARCH, 2005, 30 (04) : 817 - 831
  • [43] Two-Machine Stochastic Flow Shops With Blocking and the Traveling Salesman Problem
    Pawel Jan Kalczynski
    Jerzy Kamburowski
    Journal of Scheduling, 2005, 8 : 529 - 536
  • [44] A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs
    T. Pasupathy
    Chandrasekharan Rajendran
    R.K. Suresh
    The International Journal of Advanced Manufacturing Technology, 2006, 27 : 804 - 815
  • [45] A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs
    Pasupathy, T
    Rajendran, C
    Suresh, RK
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 27 (7-8): : 804 - 815
  • [46] A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs
    Pasupathy, T.
    Rajendran, Chandrasekharan
    Suresh, R.K.
    International Journal of Advanced Manufacturing Technology, 2006, 27 (7-8): : 804 - 815
  • [47] Minimizing the expected makespan of a project with stochastic activity durations under resource constraints
    Stefan Creemers
    Journal of Scheduling, 2015, 18 : 263 - 273
  • [48] Minimizing the expected makespan of a project with stochastic activity durations under resource constraints
    Creemers, Stefan
    JOURNAL OF SCHEDULING, 2015, 18 (03) : 263 - 273
  • [49] SEQUENCING TASKS WITH EXPONENTIAL SERVICE TIMES TO MINIMIZE THE EXPECTED FLOW TIME OR MAKESPAN
    BRUNO, J
    DOWNEY, P
    FREDERICKSON, GN
    JOURNAL OF THE ACM, 1981, 28 (01) : 100 - 113
  • [50] MINIMIZING FLOW TIME IN PARALLEL MACHINE SCHEDULE PROBLEM SUBJECT TO MINIMUM MAKESPAN
    Wang, Xiongzhi
    Wen, Xiaowei
    ICIM 2008: PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT, 2008, : 42 - 50
12345