Metaheuristic for Solving Multi-Objective Job Shop Scheduling Problem in a Robotic Cell

被引：11

作者：

Li, Xiaohui ^{[1
]}

Yang, Xi ^{[1
]}

Zhao, Yi ^{[1
]}

Teng, Ying ^{[2
]}

Dong, Yuan ^{[1
]}

机构：

[1] Changan Univ, Sch Elect & Control Engn, Xian 710054, Peoples R China

[2] Univ Elect Sci & Technol China, Sch Management & Econ, Chengdu 610051, Peoples R China

来源：

IEEE ACCESS | 2020年 / 8卷

关键词：

Job shop scheduling; Approximation algorithms; Service robots; Workstations; Optimal scheduling; Robotic cell; job shop; multi-objective optimization; local search; teaching-learning based optimization; PARTICLE SWARM OPTIMIZATION; LOCAL SEARCH; ALGORITHM; MAKESPAN; MACHINE; DESIGN; TIME;

D O I：

10.1109/ACCESS.2020.3015796

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper deals with the multi-objective job shop scheduling problem in a robotic cell (MOJRCSP). All the jobs are processed according to their operations order on workstations. Different from classical job shop scheduling problem, the studied problem considers that jobs' transportation is handled by a robot. Also, the jobs are expected to be finished in a time window, instead of a constant due date. A mixed Integer Programming (MIP) model is proposed to formulate this problem. Due to the special characteristics of the studied problem and its NP-hard computational complexity, a metaheuristic based on Teaching Learning Based Optimization (TLBO) algorithm has been proposed. The proposed algorithm determines simultaneously the operations' assignments on workstations, the robot assignments for transportation operations, and the robot moving sequence. The objective is to minimize the makespan and the total earliness and tardiness. Computational results further validated the effectiveness and robustness of our proposed algorithm.

引用

页码：147015 / 147028

页数：14

共 36 条

[1] Robotic Surgery for Renal Cell Carcinoma with Vena Caval Tumor Thrombus [J].

Abaza, Ronney ;

Eun, Daniel D. ;

Gallucci, Michele ;

Gill, Inderbir S. ;

Menon, Mani ;

Mottrie, Alexandre ;

Shabsigh, Ahmad .

EUROPEAN UROLOGY FOCUS, 2016, 2 (06) :601-607

[2]

[Anonymous], 2019, COMPUT OPER RES, DOI DOI 10.1016/J.COR.2019.03.004

[3]

[Anonymous], 2017, COMPUT IND ENG, DOI DOI 10.1016/J.CIE.2017.07.021

[4] Knowledge-guided local search for the vehicle routing problem [J].

Arnold, Florian ;

Sorensen, Kenneth .

COMPUTERS & OPERATIONS RESEARCH, 2019, 105 :32-46

[5] An MILP for scheduling problems in an FMS with one vehicle [J].

Caumond, A. ;

Lacomme, P. ;

Moukrim, A. ;

Tchernev, N. .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 199 (03) :706-722

[6] A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell [J].

Che, Ada ;

Hu, Hongjian ;

Chabrol, Michelle ;

Gourgand, Michel .

COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (09) :1275-1285

[7]

Chinta S., 2011, INF SCI, V373, P337

[8] A fast and elitist multiobjective genetic algorithm: NSGA-II [J].

Deb, K ;

Pratap, A ;

Agarwal, S ;

Meyarivan, T .

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197

[9] New multi-objective method to solve reentrant hybrid flow shop scheduling problem [J].

Dugardin, Frederic ;

Yalaoui, Farouk ;

Amodeo, Lionel .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 203 (01) :22-31

[10] Cyclic job shop robotic cell scheduling problem: Ant colony optimization [J].

Elmi, Atabak ;

Topaloglu, Seyda .

COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 111 :417-432

← 1 2 3 4 →