Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times

被引：10
作者：
Shabtay, Dvir [1 ]
Arviv, Kfir [1 ]
机构：
[1] Ben Gurion Univ Negev, Dept Ind Engn & Management, IL-84105 Beer Sheva, Israel
来源：
APPLIED MATHEMATICAL MODELLING | 2016年 / 40卷 / 5-6期
关键词：
Scheduling; Flow-shop; Identical jobs; Makespan; Transportation times; Robot; SINGLE-MACHINE; CELL; TRANSPORTATION; TARDINESS; ALGORITHM; PARTS; LAGS;
D O I：
10.1016/j.apm.2015.11.021
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
We study a robotic three-machine flow-shop scheduling problem, in which n identical jobs are to be processed and the objective is to minimize the makespan. After the job's completion on either the first or the second machine it is transferred by a robot to the next (consecutive) machine in the shop. A single robot is available for transferring the jobs. We show that the problem can be solved by decomposing it into a set of sub-problems, and by providing a robot schedule to each sub-problem that yields a makespan value which matches the lower bound value. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码：4231 / 4247
页数：17
相关论文
共 50 条
[31]   A note on "On three-machine flow shop scheduling with deteriorating jobs" [J].
Jafari, Abbas-Ali ;
Khademi-Zare, Hassan ;
Lotfi, M. M. ;
Tavakkoli-Moghaddam, Reza .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2017, 191 :250-252
[32]   Three-stage flow-shop scheduling model with batch processing machine and discrete processing machine [J].
Mauluddin, Yusuf .
3RD ANNUAL APPLIED SCIENCE AND ENGINEERING CONFERENCE (AASEC 2018), 2018, 197
[33]   Two-machine flow-shop scheduling to minimize total late work: revisited [J].
Chen, Xin ;
Wang, Zhongyu ;
Pesch, Erwin ;
Sterna, Malgorzata ;
Blazewicz, Jacek .
ENGINEERING OPTIMIZATION, 2019, 51 (07) :1268-1278
[34]   A note on "Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan" [J].
Hadda, Hatem .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2015, 159 :221-222
[35]   Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan [J].
Shabtay, Dvir ;
Zofi, Moshe .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2018, 198 :191-200
[36]   Two-machine flow-shop scheduling to minimize total late work [J].
Lin, B. M. T. ;
Lin, F. C. ;
Lee, R. C. T. .
ENGINEERING OPTIMIZATION, 2006, 38 (04) :501-509
[37]   An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan [J].
Gu, Manzhan ;
Lu, Xiwen ;
Gu, Jinwei .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (02) :473-495
[38]   An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan [J].
Manzhan Gu ;
Xiwen Lu ;
Jinwei Gu .
Journal of Combinatorial Optimization, 2017, 33 :473-495
[39]   A note on flow-shop and job-shop batch scheduling with identical processing-time jobs [J].
Mosheiov, G ;
Oron, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 161 (01) :285-291
[40]   Algorithms for four-machine flowshop scheduling problem with uncertain processing times to minimize makespan [J].
Allahverdi, Muberra ;
Allahverdi, Ali .
RAIRO-OPERATIONS RESEARCH, 2020, 54 (02) :529-553
12345