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., 2015, Volume 22, Issue 4, Pages 63–79 (Mi da825)  

This article is cited in 1 scientific paper (total in 1 paper)

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

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.

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

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

English version:
Journal of Applied and Industrial Mathematics, 2015, 9:4, 570–579

Bibliographic databases:

UDC: 519.2+621.391
Received: 17.03.2015
Revised: 06.05.2015

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://www.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:
  • http://mi.mathnet.ru/eng/da825
  • http://mi.mathnet.ru/eng/da/v22/i4/p63

    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

    This publication is cited in the following articles:
    1. Hamdi I., Tekaya M.F., “a Genetic Algorithm to Minimize the Makespan in a Two-Machine Cross-Docking Flow Shop Problem”, J. Oper. Res. Soc. China  crossref  mathscinet  isi  scopus
  • Дискретный анализ и исследование операций
    Number of views:
    This page:167
    Full text:76
    References:21
    First page:9

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