Scheduling of Mobile Robots Using Constraint Programming

D 2019

Scheduling of Mobile Robots Using Constraint Programming

MURÍN, Stanislav and Hana RUDOVÁ

Basic information

Original name

Scheduling of Mobile Robots Using Constraint Programming

Authors

MURÍN, Stanislav (703 Slovakia, belonging to the institution) and Hana RUDOVÁ (203 Czech Republic, guarantor, belonging to the institution)

Edition

Switzerland, Principles and Practice of Constraint Programming, p. 456-471, 16 pp. 2019

Publisher

Springer International Publishing

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

United States of America

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

printed version "print"

References:

URL

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/19:00110233

Organization unit

Faculty of Informatics

ISBN

978-3-030-30047-0

ISSN

DOI

http://dx.doi.org/10.1007/978-3-030-30048-7_27

UT WoS

000560404200027

Keywords in English

Scheduling; Constraint programming; Mobile robot;Flexible manufacturing system; Transportation; IBM ILOG CPLEX Optimization Studio

Abstract

V originále

Mobile robots in flexible manufacturing systems can transport components for jobs between machines as well as process jobs on selected machines. While the job shop problem with transportation resources allows encapsulating of transportation, this work concentrates on the extended version of the problem, including the processing by mobile robots. We propose a novel constraint programming model for this problem where the crucial part of the model lies in a proper inclusion of the transportation. We have implemented it in the Optimization Programming Language using the CP Optimizer, and compare it with the existing mixed integer programming solver. While both approaches are capable of solving the problem optimally, a new constraint programming approach works more efficiently, and it can compute solutions in more than an order of magnitude faster. Given that, the results of more realistic data instances are delivered in real-time, which is very important in a smart factory.

Links

MUNI/A/1018/2018, interní kód MU

Name: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace VIII.

Investor: Masaryk University, Category A

MUNI/A/1040/2018, interní kód MU

Name: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity 19 (Acronym: SKOMU)

Investor: Masaryk University, Category A

Citovat

MURÍN, Stanislav and Hana RUDOVÁ. Scheduling of Mobile Robots Using Constraint Programming. In Thomas Schiex, Simon de Givry. Principles and Practice of Constraint Programming. Switzerland: Springer International Publishing, 2019, p. 456-471. ISBN 978-3-030-30047-0. Available from: https://dx.doi.org/10.1007/978-3-030-30048-7_27.

@inproceedings{1546818,
   author = {Murín, Stanislav and Rudová, Hana},
   address = {Switzerland},
   booktitle = {Principles and Practice of Constraint Programming},
   doi = {http://dx.doi.org/10.1007/978-3-030-30048-7_27},
   editor = {Thomas Schiex, Simon de Givry},
   keywords = {Scheduling; Constraint programming; Mobile robot;Flexible manufacturing system; Transportation; IBM ILOG CPLEX Optimization Studio},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Switzerland},
   isbn = {978-3-030-30047-0},
   pages = {456-471},
   publisher = {Springer International Publishing},
   title = {Scheduling of Mobile Robots Using Constraint Programming},
   url = {https://link.springer.com/chapter/10.1007/978-3-030-30048-7_27},
   year = {2019}
}

TY  - JOUR
ID  - 1546818
AU  - Murín, Stanislav - Rudová, Hana
PY  - 2019
TI  - Scheduling of Mobile Robots Using Constraint Programming
PB  - Springer International Publishing
CY  - Switzerland
SN  - 9783030300470
KW  - Scheduling
KW  - Constraint programming
KW  - Mobile robot;Flexible manufacturing system
KW  - Transportation
KW  - IBM ILOG CPLEX Optimization Studio
UR  - https://link.springer.com/chapter/10.1007/978-3-030-30048-7_27
L2  - https://link.springer.com/chapter/10.1007/978-3-030-30048-7_27
N2  - Mobile robots in flexible manufacturing systems can transport components for jobs between machines as well as process jobs on selected machines. While the job shop problem with transportation resources allows encapsulating of transportation, this work concentrates on the extended version of the problem, including the processing by mobile robots. We propose a novel constraint programming model for this problem where the crucial part of the model lies in a proper inclusion of the transportation. We have implemented it in the Optimization Programming Language using the CP Optimizer, and compare it with the existing mixed integer programming solver. While both approaches are capable of solving the problem optimally, a new constraint programming approach works more efficiently, and it can compute solutions in more than an order of magnitude faster. Given that, the results of more realistic data instances are delivered in real-time, which is very important in a smart factory.
ER  -

MURÍN, Stanislav and Hana RUDOVÁ. Scheduling of Mobile Robots Using Constraint Programming. In Thomas Schiex, Simon de Givry. \textit{Principles and Practice of Constraint Programming}. Switzerland: Springer International Publishing, 2019, p.~456-471. ISBN~978-3-030-30047-0. Available from: https://dx.doi.org/10.1007/978-3-030-30048-7\_{}27.

Detailed Information on Publication Record