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., 1996, Volume 3, Number 2, Pages 15–32 (Mi da433)  

This article is cited in 15 scientific papers (total in 15 papers)

Combinatorial complexity of scheduling jobs with simple linear growth of processing times

A. V. Kononov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Full text: PDF file (1728 kB)

Bibliographic databases:
UDC: 519.8
Received: 12.03.1996

Citation: A. V. Kononov, “Combinatorial complexity of scheduling jobs with simple linear growth of processing times”, Diskretn. Anal. Issled. Oper., 3:2 (1996), 15–32

Citation in format AMSBIB
\Bibitem{Kon96}
\by A.~V.~Kononov
\paper Combinatorial complexity of scheduling jobs with simple linear growth of processing times
\jour Diskretn. Anal. Issled. Oper.
\yr 1996
\vol 3
\issue 2
\pages 15--32
\mathnet{http://mi.mathnet.ru/da433}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1402741}
\zmath{https://zbmath.org/?q=an:0859.90086}


Linking options:
  • http://mi.mathnet.ru/eng/da433
  • http://mi.mathnet.ru/eng/da/v3/i2/p15

    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. Kononov A., Gawiejnowicz S., “NP-hard cases in scheduling deteriorating jobs on dedicated machines”, Journal of the Operational Research Society, 52:6 (2001), 708–717  crossref  zmath  isi  scopus
    2. Gawiejnowicz S., Kurc W., Pankowska L., “Minimizing time-dependent total completion time on parallel identical machines”, Parallel Processing and Applied Mathematics, Lecture Notes in Computer Science, 3019, 2003, 89–96  crossref  isi
    3. Gawiejnowicz S., Kurc W., Pankowska L., “Parallel machine scheduling of deteriorating jobs by modified steepest descent search”, Parallel Processing and Applied Mathematics, Lecture Notes in Computer Science, 3911, 2006, 116–123  crossref  zmath  isi  scopus
    4. Xu Chuan-Rong, Chen R., Yang X., Jie Zh., “Flow shop scheduling with deteriorating processing time and chains constraint”, Wavelet Active Media Technology and Information Processing, 2006, 633–638  isi
    5. Cheng M., Sun Sh., He L., “Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines”, European J Oper Res, 183:1 (2007), 115–124  crossref  mathscinet  zmath  isi  elib  scopus
    6. Gawiejnowicz S., “Scheduling deteriorating jobs subject to job or machine availability constraints”, European J Oper Res, 180:1 (2007), 472–478  crossref  zmath  isi  scopus
    7. Ji M., Cheng T.C.E., “Parallel-machine scheduling of simple linear deteriorating jobs”, Theoret Comput Sci, 410:38–40 (2009), 3761–3768  crossref  mathscinet  zmath  isi  elib  scopus
    8. Ng C.T., Barketau M.S., Cheng T.C.E., Kovalyov M.Y., ““Product Partition” and related problems of scheduling and systems reliability: Computational complexity and approximation”, European J Oper Res, 207:2 (2010), 601–604  crossref  mathscinet  zmath  isi  elib  scopus
    9. Ji M., Cheng T.C.E., “Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan”, European J Oper Res, 202:1 (2010), 90–98  crossref  mathscinet  zmath  isi  elib  scopus
    10. Thornblad K., Patriksson M., “A note on the complexity of flow-shop scheduling with deteriorating jobs”, Discrete Appl Math, 159:4 (2011), 251–253  crossref  mathscinet  zmath  isi  elib  scopus
    11. Li Sh., “Scheduling Proportionally Deteriorating Jobs in Two-Machine Open Shop with a Non-Bottleneck Machine”, Asia Pac J Oper Res, 28:5 (2011), 623–631  crossref  mathscinet  zmath  isi  elib  scopus
    12. Zhao Ch., Tang H., “Two-machine flow shop scheduling with deteriorating jobs and chain precedence constraints”, International Journal of Production Economics, 136:1 (2012), 131–136  crossref  zmath  isi  scopus
    13. Rudek R., “A Note on Proving the Strong NP-Hardness of Some Scheduling Problems with Start Time Dependent Job Processing Times”, Optim. Lett., 6:5 (2012), 1021–1025  crossref  mathscinet  zmath  isi  scopus
    14. Gawiejnowicz S. Kononov A., “Isomorphic Scheduling Problems”, Ann. Oper. Res., 213:1 (2014), 131–145  crossref  mathscinet  zmath  isi  elib  scopus
    15. Tang L., Zhao X., Liu J., Leung J.Y.-T., “Competitive Two-Agent Scheduling With Deteriorating Jobs on a Single Parallel-Batching Machine”, Eur. J. Oper. Res., 263:2 (2017), 401–411  crossref  mathscinet  zmath  isi  scopus
  • Дискретный анализ и исследование операций
    Number of views:
    This page:296
    Full text:121
    First page:1

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