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 条

[21] Improved Scheduling for the Three-Machine Proportionate Open Shop and Mixed Shop Minimum Makespan Problems [J].

Ni, Guanqun ;

Chen, Lei .

IEEE ACCESS, 2020, 8 :186805-186812

[22] A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times [J].

Cheng, JL ;

Steiner, G ;

Stephenson, P .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 130 (03) :559-575

[23] Heuristic Model for Dynamic Single Machine Group Scheduling in Laser Cutting Job Shop to Minimize the Makespan [J].

Ying, Nyeoh Cheng ;

Bin Mokhtar, Mohzani .

MANUFACTURING SCIENCE AND TECHNOLOGY, PTS 1-8, 2012, 383-390 :6236-+

[24] Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations [J].

Sotskov, Yuri N. ;

Matsveichuk, Natalja M. ;

Hatsura, Vadzim D. .

ALGORITHMS, 2020, 13 (01)

[25] A variable neighborhood search for job shop scheduling with set-up times to minimize makespan [J].

Roshanaei, V. ;

Naderi, B. ;

Jolai, F. ;

Khalili, M. .

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2009, 25 (06) :654-661

[26] An evaluation of flow-shop scheduling algorithms for makespan reduction in a stochastic environment [J].

Taylor, GD ;

Venkataraman, S ;

Sadiq, M .

PRODUCTION PLANNING & CONTROL, 1996, 7 (02) :129-143

[27] Parallel machine scheduling problem to minimize the makespan with resource dependent processing times [J].

Li, Kai ;

Shi, Ye ;

Yang, Shan-lin ;

Cheng, Ba-yi .

APPLIED SOFT COMPUTING, 2011, 11 (08) :5551-5557

[28] Three-machine flow shop scheduling with overlapping waiting time constraints [J].

Kim, Hyun-Jung ;

Lee, Jun-Ho .

COMPUTERS & OPERATIONS RESEARCH, 2019, 101 :93-102

[29] Schedule execution for two-machine flow-shop with interval processing times [J].

Matsveichuk, N. M. ;

Sotskov, Yu. N. ;

Egorova, N. G. ;

Lai, T. -C. .

MATHEMATICAL AND COMPUTER MODELLING, 2009, 49 (5-6) :991-1011

[30] Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times [J].

Yokoyama, M ;

Santos, DL .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 161 (03) :754-770

← 1 2 3 4 5 →