RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

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


Diskretn. Anal. Issled. Oper., 2017, Volume 24, Number 1, Pages 5–20 (Mi da860)  

Construction of cyclic schedules in presence of parallel machines

E. A. Bobrova, V. V. Servakh

Omsk Branch of Sobolev Institute of Mathematics, 13 Pevtsov St., 644043 Omsk, Russia

Abstract: We consider the problem of processing some identical jobs with a complicated technological route on some production line in presence of parallel machines. Under some constraints on the number of jobs processed simultaneously, a cyclic schedule is desired with minimum cycle duration. Some algorithm for construction of an exact solution is proposed and substantiated. Also, we found the case of pseudopolynomially solvable problem. Illustr. 4, bibliogr. 16.

Keywords: cyclic schedule, dynamic programming, pseudopolynomial algorithm.

Funding Agency Grant Number
Russian Academy of Sciences - Federal Agency for Scientific Organizations 0314-2015-0009


DOI: https://doi.org/10.17377/daio.2017.24.500

Full text: PDF file (467 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2017, 11:1, 17–25

Bibliographic databases:

UDC: 519.8
Received: 03.07.2015
Revised: 30.08.2016

Citation: E. A. Bobrova, V. V. Servakh, “Construction of cyclic schedules in presence of parallel machines”, Diskretn. Anal. Issled. Oper., 24:1 (2017), 5–20; J. Appl. Industr. Math., 11:1 (2017), 17–25

Citation in format AMSBIB
\Bibitem{BobSer17}
\by E.~A.~Bobrova, V.~V.~Servakh
\paper Construction of cyclic schedules in presence of parallel machines
\jour Diskretn. Anal. Issled. Oper.
\yr 2017
\vol 24
\issue 1
\pages 5--20
\mathnet{http://mi.mathnet.ru/da860}
\crossref{https://doi.org/10.17377/daio.2017.24.500}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3622062}
\elib{http://elibrary.ru/item.asp?id=28905202}
\transl
\jour J. Appl. Industr. Math.
\yr 2017
\vol 11
\issue 1
\pages 17--25
\crossref{https://doi.org/10.1134/S1990478917010033}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85013962567}


Linking options:
  • http://mi.mathnet.ru/eng/da860
  • http://mi.mathnet.ru/eng/da/v24/i1/p5

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретный анализ и исследование операций
    Number of views:
    This page:131
    Full text:25
    References:24
    First page:9

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020