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.
Other formats:   BibTeX LaTeX RIS
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
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
WWW 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 0302-9743
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
Tags core_A, firank_A
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 6/5/2020 17:16.
Abstract
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 MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace VIII.
Investor: Masaryk University, Category A
MUNI/A/1040/2018, interní kód MUName: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity 19 (Acronym: SKOMU)
Investor: Masaryk University, Category A
PrintDisplayed: 25/5/2024 18:51