Modelling and Solving Industrial Production Tasks as Planning-Scheduling Tasks

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F25%3A00381186" target="_blank" >RIV/68407700:21730/25:00381186 - isvavai.cz</a>

Result on the web

<a href="http://hdl.handle.net/10467/124630" target="_blank" >http://hdl.handle.net/10467/124630</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.datak.2025.102415" target="_blank" >10.1016/j.datak.2025.102415</a>

Result language

angličtina

Original language name

Modelling and Solving Industrial Production Tasks as Planning-Scheduling Tasks

Original language description

Industrial production planning or manufacturing concerns the selection of activities that can produce a desired product and scheduling them on resources that perform these activities. To deal with such problems techniques in the fields of Automated Planning and Scheduling might be leveraged, which are usually pursued separately even though they are (very) complementary. In manufacturing, the activities represent elementary steps in the production and each activity requires a specific input in order to produce a desired output. From that perspective, activities resemble actions in planning as they can capture such a requirement. Selecting proper activities including their (partial) ordering can be understood as a planning task while allocating the activities to the resources can be understood as a scheduling task. This paper formalises the concept of “combined” planning and scheduling tasks by defining planning-scheduling tasks that are suitable for problems concerning industrial production or manufacturing. In particular, we define two types of activities – production and maintenance activities – where the former describes elementary production tasks while the latter modifies attributes of the resources (e.g. changing the configuration of reconfigurable machines). We introduce an extension of Planning Domain Definition Language (PDDL), a well-known language for describing planning tasks, to support modelling of planning-scheduling tasks. To tackle planning-scheduling tasks we propose two compilation schemes, one into temporal planning (in PDDL 2.1) and one into classical planning. We evaluated our approaches in three use cases of industrial production planning — Reconfigurable Machines, Woodworking, and Tube Factory domains. The results showed that solving planning-scheduling tasks by compiling them into planning tasks in order to use off-the-shelf planning engines is suitable as it scales reasonably well with the size of the actual tasks (although the resulting solutions are suboptimal).

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

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

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2025

Confidentiality

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

Name of the periodical

Data and Knowledge Engineering

ISSN

0169-023X

e-ISSN

1872-6933

Volume of the periodical

157

Issue of the periodical within the volume

May

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

24

Pages from-to

—

UT code for WoS article

001429393100001

EID of the result in the Scopus database

2-s2.0-85217887361