A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage
- Autores: Kononova P.1,2, Kochetov Y.1,2
-
Afiliações:
- Sobolev Institute of Mathematics
- Novosibirsk State University
- Edição: Volume 13, Nº 2 (2019)
- Páginas: 239-249
- Seção: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213167
- DOI: https://doi.org/10.1134/S1990478919020054
- ID: 213167
Citar
Resumo
We present a new mathematical model for a single machine scheduling problem originated from the tile industry. The model takes into account the sequence-dependent setup times, the minimal batch size, heterogeneous orders of customers, and a stock in storage. As the objective function we use the penalty for tardiness of the customers’ orders and the total storage cost for final products. A mixed-integer linear programming model is applied for small test instances. For real-world applications, we design a randomized tabu search algorithm. The computational results for some test instances from a Novorossiysk company are discussed.
Palavras-chave
Sobre autores
P. Kononova
Sobolev Institute of Mathematics; Novosibirsk State University
Autor responsável pela correspondência
Email: pkononova@math.nsc.ru
Rússia, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 1, Novosibirsk, 630090
Yu. Kochetov
Sobolev Institute of Mathematics; Novosibirsk State University
Autor responsável pela correspondência
Email: jkochet@math.nsc.ru
Rússia, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 1, Novosibirsk, 630090