Scheduling multiple robots in a no-wait re-entrant robotic flowshop

被引：34
|
作者：
Che, Ada [1 ]
Chabrol, Michelle [2 ]
Gourgand, Michel [2 ]
Wang, Yuan [1 ]
机构：
[1] NW Polytech Univ, Sch Management, Xian 710072, Peoples R China
[2] Univ Clermont Ferrand, LIMOS, F-63173 Aubiere, France
来源：
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2012年 / 135卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Robotic flowshop; Scheduling; No-wait; Polynomial algorithm; Multiple robots; POLYNOMIAL ALGORITHM; ELECTROPLATING LINE; HOIST; CELLS; CONSTRAINTS; SYSTEMS; TIMES;
D O I：
10.1016/j.ijpe.2011.07.008
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
No-wait re-entrant robotic flowshops are widely used in the electronic industry, such as PCB and semiconductor manufacturing. In such an industry, cyclic production policy is often used due to large lot size and simplicity of implementation. This paper addresses cyclic scheduling of a no-wait re-entrant robotic flowshop with multiple robots for material handling. We formulate the problem and propose a polynomial algorithm to find the minimum number of robots for all feasible cycle times. Consequently, the minimum cycle time for any given number of robots can be obtained with the proposed algorithm. The algorithm runs in O(N(5)) time in the worst case, where N is the number of machines in the robotic flowshop. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：199 / 208
页数：10
相关论文
共 50 条
  • [1] Solving Re-entrant No-wait Flowshop Scheduling Problem
    Hassanpour, S. Tasouji
    Amin-Naseri, M. R.
    Nahavandi, N.
    [J]. INTERNATIONAL JOURNAL OF ENGINEERING, 2015, 28 (06): : 903 - 912
  • [2] STOCHASTIC FLOWSHOP NO-WAIT SCHEDULING
    FROSTIG, E
    ADIRI, I
    [J]. JOURNAL OF APPLIED PROBABILITY, 1985, 22 (01) : 240 - 246
  • [3] A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
    Kats, V
    Levner, E
    [J]. OPERATIONS RESEARCH LETTERS, 1997, 21 (04) : 171 - 179
  • [4] Lagrangian Relaxation algorithms for re-entrant hybrid flowshop scheduling
    Jiang, Shujun
    Tang, Lixin
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 1, 2008, : 78 - 81
  • [5] Re-Entrant Flowshop Scheduling With Learning Considerations to Minimize The Makespan
    Wu, Chin-Chia
    Liu, Shang-Chia
    Cheng, T. C. E.
    Cheng, Yu
    Liu, Shi-Yuan
    Lin, Win-Chin
    [J]. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A-SCIENCE, 2018, 42 (A2): : 727 - 744
  • [6] Re-Entrant Flowshop Scheduling With Learning Considerations to Minimize The Makespan
    Chin-Chia Wu
    Shang-Chia Liu
    T. C. E. Cheng
    Yu Cheng
    Shi-Yuan Liu
    Win-Chin Lin
    [J]. Iranian Journal of Science and Technology, Transactions A: Science, 2018, 42 : 727 - 744
  • [7] Multi-degree cyclic scheduling of two robots in a no-wait flowshop
    Che, A
    Chu, CB
    [J]. IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2005, 2 (02) : 173 - 183
  • [8] Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
    Che, Ada
    Chu, Chengbin
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (01) : 77 - 88
  • [9] HEURISTIC ALGORITHMS FOR SCHEDULING IN THE NO-WAIT FLOWSHOP
    GANGADHARAN, R
    RAJENDRAN, C
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1993, 32 (03) : 285 - 290
  • [10] Iterated Local Search for Distributed Multiple Assembly No-wait Flowshop Scheduling
    Li, Peng
    Yang, Yixin
    Du, Xiying
    Qu, Xinghua
    Wang, Keyang
    Liu, Bo
    [J]. 2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 1565 - 1571
12345