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, 2015, Volume 22, Issue 4, Pages 63–79
DOI: https://doi.org/10.17377/daio.2015.22.483 (Mi da825) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Effective algorithms for one scheduling problem on two machines with makespan minimization

A. A. Romanovaab

a Omsk Law Academy, 12 Korolenko St., 644010 Omsk, Russia
b Omsk State University, 55-a Mir Ave., 644077 Omsk, Russia
Full-text PDF (319 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2015.22.483
Abstract: We consider an NP-hard problem of scheduling a set of jobs of equal processing time on two machines, given a partial precedence order between the jobs, with an objective to minimize the makespan. An approximation algorithm with performance guarantee is proposed for this problem. Polynomial solvability of the problem is proved in the case when each job on the first machine is in precedence relation with two jobs on the second machine. Ill. 9, bibliogr. 8.
Keywords: cross-docking problem, schedule, partial order, approximation algorithm.
Received: 17.03.2015
Revised: 06.05.2015
English version:
Journal of Applied and Industrial Mathematics, 2015, Volume 9, Issue 4, Pages 570–579
DOI: https://doi.org/10.1134/S1990478915040134
Bibliographic databases:
Document Type: Article
UDC: 519.2+621.391
Language: Russian
Citation: A. A. Romanova, “Effective algorithms for one scheduling problem on two machines with makespan minimization”, Diskretn. Anal. Issled. Oper., 22:4 (2015), 63–79; J. Appl. Industr. Math., 9:4 (2015), 570–579
Citation in format AMSBIB
\Bibitem{Rom15}
\by A.~A.~Romanova
\paper Effective algorithms for one scheduling problem on two machines with makespan minimization
\jour Diskretn. Anal. Issled. Oper.
\yr 2015
\vol 22
\issue 4
\pages 63--79
\mathnet{http://mi.mathnet.ru/da825}
\crossref{https://doi.org/10.17377/daio.2015.22.483}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3467236}
\elib{https://elibrary.ru/item.asp?id=23859898}
\transl
\jour J. Appl. Industr. Math.
\yr 2015
\vol 9
\issue 4
\pages 570--579
\crossref{https://doi.org/10.1134/S1990478915040134}
Linking options:
  • https://www.mathnet.ru/eng/da825
  • https://www.mathnet.ru/eng/da/v22/i4/p63
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:228
    Full-text PDF :171
    References:34
    First page:9
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024