The two-stage no-wait/blocking proportionate super shop scheduling problem

被引：7
|
作者：
Koulamas, Christos [1 ]
Panwalkar, S. S. [2 ]
机构：
[1] Florida Int Univ, Dept Informat Syst & Business Analyt, Miami, FL 33199 USA
[2] Johns Hopkins Univ, Carey Business Sch, Baltimore, MD USA
来源：
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 2019年 / 57卷 / 10期
关键词：
scheduling; dynamic programming; super shop; no wait; blocking; proportionate; ALGORITHM; MACHINE;
D O I：
10.1080/00207543.2018.1518603
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
We analyze the 'no-wait' proportionate two-stage super shop scheduling problem with the objective of minimising the maximum job completion time (makespan). The existing simple sorting procedures for the open shop and the job shop do not work on the super shop. We show that the problem is still solvable in time using a procedure based on dynamic programming (DP). A unique feature of this procedure is that the state variable is defined based on the number of jobs; thus, reducing the complexity to polynomial. The same procedure solves the super shop problem with the blocking constraint. We also consider the case of machine dominance and show that the problem can be solved in linear time. Finally, we highlight the differences between the super shop with 'no-wait' and 'synchronous' processing modes via a numerical example.
引用
下载
收藏
页码：2956 / 2965
页数：10
相关论文
共 50 条
  • [21] Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
    Zhong, Weiya
    Shi, Yun
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (01) : 108 - 125
  • [22] An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
    Dong, Jianming
    Jiang, Yiwei
    Zhang, An
    Hu, Jueliang
    Luo, Hui
    INFORMATION PROCESSING LETTERS, 2015, 115 (04) : 475 - 480
  • [23] Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
    Weiya Zhong
    Yun Shi
    Journal of Combinatorial Optimization, 2018, 35 : 108 - 125
  • [24] A Combination of Two Simple Decoding Strategies for the No-wait Job Shop Scheduling Problem
    Valenzuela, Victor M.
    Brizuela, Carlos A.
    Cosio-Leon, M. A.
    Danisa Romero-Ocano, A.
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 864 - 871
  • [25] Two-stage no-wait scheduling models with setup and removal times separated
    Gupta, JND
    Strusevich, VA
    Zwaneveld, CM
    COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (11) : 1025 - 1031
  • [26] An Efficient Algorithm for Scheduling a Flexible Job Shop with Blocking and No-Wait Constraints
    Aschauer, A.
    Roetzer, F.
    Steinboeck, A.
    Kugi, A.
    IFAC PAPERSONLINE, 2017, 50 (01): : 12490 - 12495
  • [27] A Heuristic for Two-Stage No-Wait Hybrid Flowshop Scheduling with a Single Machine in Either Stage
    刘志新
    谢金星
    李建国
    董杰方
    Tsinghua Science and Technology, 2003, (01) : 43 - 48
  • [28] An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines
    Rabiee, M.
    Rad, Reza Sadeghi
    Mazinani, M.
    Shafaei, R.
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2014, 71 (5-8): : 1229 - 1245
  • [29] Hybrid Discrete EDA for the No-Wait Flow Shop Scheduling Problem
    Sun, Zewen
    Gu, Xingsheng
    INTELLIGENT COMPUTING, NETWORKED CONTROL, AND THEIR ENGINEERING APPLICATIONS, PT II, 2017, 762 : 105 - 114
  • [30] An intelligent hybrid meta-heuristic for solving a case of no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines
    M. Rabiee
    Reza Sadeghi Rad
    M. Mazinani
    R. Shafaei
    The International Journal of Advanced Manufacturing Technology, 2014, 71 : 1229 - 1245
12345