arrow
返回

Two-machine robotic cell scheduling problem with sequence-dependent setup times

delete2013-05-01
delete37
PRE
AI
M
M.H. Fazel Zarandi *
H
Hadi Mosadegh
M
Mohammad Fattahi
DOI:10.1016/j.cor.2012.09.006delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper, we introduce a new and practical two-machine robotic cell scheduling problem with sequence-dependent setup times (2RCSDST) along with different loading/unloading times for each part. Our objective is to simultaneously determine the sequence of robot moves and the sequence of parts that minimize the total cycle time. The proposed problem is proven to be strongly NP-hard. Using the Gilmore and Gomory (GnG) algorithm, a polynomial-time computable lower bound is provided. Based on the input parameters, a dominance condition is developed to determine the optimal sequence of robot moves for a given sequence of parts. A mixed-integer linear programming (MILP) model is provided and enhanced using a valid inequality based on the given dominance condition. In addition, a branch and bound (BnB) algorithm is exploited to solve the problem, and due to the NP-hardness, an improved simulated annealing (SA) algorithm is proposed to address large-sized test problems. All the solution methods are evaluated using small-, medium- and large-sized test problems. The numerical results indicate that the optimal solution of the MILP model is attained for the medium- and some large-sized test problems, and the proposed SA, tuned using the Taguchi technique, provides an acceptable, near-optimal solution with markedly reduced CPU time. Moreover, the lower bound is observed to be significantly near the optimal solution. Thus, this lower bound is exploited to validate the results of the SA algorithm for large-sized test problems. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Robotic cell scheduling
Sequence-dependent setup times
Mixed-integer linear programming
Simulated annealing
Branch and bound
Taguchi
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

A
Amirkabir University of Technology
学者数:
1.1W
论文数: 1.1W
被引数: 1.0W
引用论文

引用论文

err分享
err收藏
Scheduling large robotic cells without buffers
err1998-01-01
err47
PREAI
errSriskandarajah, C; Hall, NG; Kamoun, H
err分享
err收藏
Vitamin E Circular Dichroism Studies: Insights into Conformational Changes Induced by the Solvent’s Polarity
err2016-12-14
err0
errOAAI
errDrew Marquardt; Brad Van Oosten; Mikel Ghelfi; Jeffrey Atkinson; Thad Harroun
err分享
err收藏
Anatomic Reconstruction of the Proximal Tibiofibular Joint
err2016-02-01
err0
errOAAI
errBrent T. Warner; Samuel G. Moulton; Tyler R. Cram; Robert F. LaPrade
err分享
err收藏
err分享
err收藏
err分享
err收藏
An analysis of cyclic scheduling problems in robot centered cells
err2012-06-01
err15
PREAI
errYildiz, Serdar; Karasan, Oya Ekin; Akturk, M. Selim
err分享
err收藏
Rapid improvement of coagulopathy by all‐trans retinoic acid in acute promyelocytic leukemia全反式维甲酸快速改善急性早幼粒细胞白血病凝血功能
err2006-07-11
err0
PREAI
errYohko Kawai; Kiyoaki Watanabe; Masahiro Kizaki; Mitsuru Murata; Tetsuji Kamata; Hideo Uchida; Takanori Moriki; Kenji Yokoyama; Michihide Tokuhira; Hideaki Nakajima; Makoto Handa; Yasuo Ikeda
err分享
err收藏
err分享
err收藏
学者 查看更多内容