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

共 53 条

[1] Scheduling no-wait robotic cells with two and three machines [J].