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

Result code in 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>

Result on the web

<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>

Result language

angličtina

Original language name

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

Original language description

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.

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

2023

Confidentiality

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

Name of the periodical

International Journal of Production Economics

ISSN

0925-5273

e-ISSN

1873-7579

Volume of the periodical

263

Issue of the periodical within the volume

September

Country of publishing house

CH - SWITZERLAND

Number of pages

20

Pages from-to

—

UT code for WoS article

001031842400001

EID of the result in the Scopus database

2-s2.0-85163890609