Scheduling of Mobile Robots Using Constraint Programming

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00110233" target="_blank" >RIV/00216224:14330/19:00110233 - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/chapter/10.1007/978-3-030-30048-7_27" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-030-30048-7_27</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-30048-7_27" target="_blank" >10.1007/978-3-030-30048-7_27</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Scheduling of Mobile Robots Using Constraint Programming

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Scheduling of Mobile Robots Using Constraint Programming

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Principles and Practice of Constraint Programming

ISBN

9783030300470

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

16

Strana od-do

456-471

Název nakladatele

Springer International Publishing

Místo vydání

Switzerland

Místo konání akce

Stamford, CT, U.S.

Datum konání akce

30. 9. 2019

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000560404200027