Scheduling of Parallel 3D-Printing Machines with Incompatible Job Families: A Matheuristic Algorithm

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F21%3A00351244" target="_blank" >RIV/68407700:21730/21:00351244 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-030-85874-2_6" target="_blank" >https://doi.org/10.1007/978-3-030-85874-2_6</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-85874-2_6" target="_blank" >10.1007/978-3-030-85874-2_6</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Scheduling of Parallel 3D-Printing Machines with Incompatible Job Families: A Matheuristic Algorithm

Popis výsledku v původním jazyce

Additive manufacturing (AM) is a promising technology for the rapid prototyping and production of highly customized products. The scheduling of AM machines has an essential role in increasing profitability and has recently received a great deal of attention. This paper investigates the scheduling of batch processing of parallel 3d-printing machines to minimize the total weighted tardiness. Accordingly, a mathematical model is proposed to formulate the problem considering the sequence-dependent setup time and incompatible job families, where jobs of different families are processed with different materials and desired quality. Due to the high complexity of the problem, an efficient matheuristic algorithm is presented based on the hybridization of a genetic algorithm and a local search method based on mixed integer programming (MIP). Computational results show that the proposed approach is efficient and promising to solve the problem.

Název v anglickém jazyce

Scheduling of Parallel 3D-Printing Machines with Incompatible Job Families: A Matheuristic Algorithm

Popis výsledku anglicky

Additive manufacturing (AM) is a promising technology for the rapid prototyping and production of highly customized products. The scheduling of AM machines has an essential role in increasing profitability and has recently received a great deal of attention. This paper investigates the scheduling of batch processing of parallel 3d-printing machines to minimize the total weighted tardiness. Accordingly, a mathematical model is proposed to formulate the problem considering the sequence-dependent setup time and incompatible job families, where jobs of different families are processed with different materials and desired quality. Due to the high complexity of the problem, an efficient matheuristic algorithm is presented based on the hybridization of a genetic algorithm and a local search method based on mixed integer programming (MIP). Computational results show that the proposed approach is efficient and promising to solve the problem.

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

<a href="/cs/project/LL1902" target="_blank" >LL1902: Obohacování SMT řešičů pomocí strojového učení</a><br>

Návaznosti

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

Rok uplatnění

2021

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

Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems

ISBN

978-3-030-85901-5

ISSN

1868-4238

e-ISSN

1868-422X

Počet stran výsledku

11

Strana od-do

51-61

Název nakladatele

Springer

Místo vydání

Cham

Místo konání akce

Nantes

Datum konání akce

5. 9. 2021

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

WRD - Celosvětová akce

Kód UT WoS článku

000717630100006