Multi-level lot-sizing and job shop scheduling with lot-streaming: Reformulation and solution approaches

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F23%3A00367392" target="_blank" >RIV/68407700:21730/23:00367392 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1016/j.ijpe.2023.108958" target="_blank" >https://doi.org/10.1016/j.ijpe.2023.108958</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Multi-level lot-sizing and job shop scheduling with lot-streaming: Reformulation and solution approaches

Popis výsledku v původním jazyce

This paper addresses a multi-level lot-sizing and job shop scheduling problem with lot-streaming. In the multi-level production system, workstations receive materials from the lower level, and after some operation, materials are shipped to the next level. Hence, establishing a material balance between the different levels is the most challenging part of multi-level production planning and scheduling. The material balance can be performed with or without lot-streaming. Lot-streaming effectively enables consecutive operations to overlap by splitting a processing lot into several sub-lots. In small-bucket time models, this capability is taken into account by establishing the material balance in each small unit of time (micro-period), which makes the models computationally expensive. In the present work, a novel and much less complicated big-bucket time formulation has been developed, which incorporates lot-streaming considering sequence-dependent setup times and capacitated machines. Computational experiments affirm the promising results of the proposed model compared to the well-known models in the literature. Moreover, two efficient heuristics have been developed for solving larger-size problems. First, the fix-and-relax algorithm as a constructive heuristic is combined with the fix-and-optimize algorithm as an improvement heuristic. Next, a decomposition heuristic is proposed using mixed-integer programming (MIP) and constraint programming (CP) in the master and sub-problem, respectively. The computational results show that the proposed heuristics are very efficient, even in solving large-sized problems.

Název v anglickém jazyce

Multi-level lot-sizing and job shop scheduling with lot-streaming: Reformulation and solution approaches

Popis výsledku anglicky

This paper addresses a multi-level lot-sizing and job shop scheduling problem with lot-streaming. In the multi-level production system, workstations receive materials from the lower level, and after some operation, materials are shipped to the next level. Hence, establishing a material balance between the different levels is the most challenging part of multi-level production planning and scheduling. The material balance can be performed with or without lot-streaming. Lot-streaming effectively enables consecutive operations to overlap by splitting a processing lot into several sub-lots. In small-bucket time models, this capability is taken into account by establishing the material balance in each small unit of time (micro-period), which makes the models computationally expensive. In the present work, a novel and much less complicated big-bucket time formulation has been developed, which incorporates lot-streaming considering sequence-dependent setup times and capacitated machines. Computational experiments affirm the promising results of the proposed model compared to the well-known models in the literature. Moreover, two efficient heuristics have been developed for solving larger-size problems. First, the fix-and-relax algorithm as a constructive heuristic is combined with the fix-and-optimize algorithm as an improvement heuristic. Next, a decomposition heuristic is proposed using mixed-integer programming (MIP) and constraint programming (CP) in the master and sub-problem, respectively. The computational results show that the proposed heuristics are very efficient, even in solving large-sized problems.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

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

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2023

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 periodika

International Journal of Production Economics

ISSN

0925-5273

e-ISSN

1873-7579

Svazek periodika

263

Číslo periodika v rámci svazku

September

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

20

Strana od-do

—

Kód UT WoS článku

001031842400001

EID výsledku v databázi Scopus

2-s2.0-85163890609