Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2019, Volume 26, Issue 2, Pages 60–78
DOI: https://doi.org/10.33048/daio.2019.26.634 (Mi da923) 		 
This article is cited in 3 scientific papers (total in 3 papers)

A local search algorithm for the single machine scheduling problem with setups and a storage

P. A. Kononovaab, Yu. A. Kochetovab

a Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090 Novosibirsk, Russia
b Novosibirsk State University, 1 Pirogov Street, 630090 Novosibirsk, Russia
Full-text PDF (370 kB) Citations (3)
References:
PDF
HTML
DOI: https://doi.org/10.33048/daio.2019.26.634
Abstract: 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. Tab. 3, illustr. 1, bibliogr. 25.
Keywords: tabu search, scheduling, due date, tardiness, setup time.
Funding agency Grant number
Siberian Branch of Russian Academy of Sciences I.5.1 (проект № 0314–2019–0014)
Received: 11.10.2018
Revised: 04.02.2019
Accepted: 27.02.2019
English version:
Journal of Applied and Industrial Mathematics, 2019, Volume 13, Issue 2, Pages 239–249
DOI: https://doi.org/10.1134/S1990478919020054
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
Citation: P. A. Kononova, Yu. A. Kochetov, “A local search algorithm for the single machine scheduling problem with setups and a storage”, Diskretn. Anal. Issled. Oper., 26:2 (2019), 60–78; J. Appl. Industr. Math., 13:2 (2019), 239–249
Citation in format AMSBIB
\Bibitem{KonKoc19}
\by P.~A.~Kononova, Yu.~A.~Kochetov
\paper A local search algorithm for the single machine scheduling problem with setups and a storage
\jour Diskretn. Anal. Issled. Oper.
\yr 2019
\vol 26
\issue 2
\pages 60--78
\mathnet{http://mi.mathnet.ru/da923}
\crossref{https://doi.org/10.33048/daio.2019.26.634}
\transl
\jour J. Appl. Industr. Math.
\yr 2019
\vol 13
\issue 2
\pages 239--249
\crossref{https://doi.org/10.1134/S1990478919020054}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85067419434}
Linking options:
  • https://www.mathnet.ru/eng/da923
  • https://www.mathnet.ru/eng/da/v26/i2/p60
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:330
    Full-text PDF :242
    References:48
    First page:10
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024