|
|
|
|
LEADER |
00000cam a2200000 i 4500 |
001 |
EBOOKCENTRAL_ocn958540910 |
003 |
OCoLC |
005 |
20240329122006.0 |
006 |
m o d |
007 |
cr |n|---||||| |
008 |
160917s1994 ne a ob 001 0 eng d |
040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d OCLCQ
|d YDX
|d OCLCQ
|d LOA
|d OCLCO
|d OCLCF
|d K6U
|d OCLCO
|d OCLCQ
|d TXI
|d OCLCO
|d OCLCL
|
019 |
|
|
|a 968318147
|a 1082343931
|
020 |
|
|
|a 9789401111904
|
020 |
|
|
|a 9401111901
|
020 |
|
|
|z 9789401045209
|
020 |
|
|
|z 9401045208
|
035 |
|
|
|a (OCoLC)958540910
|z (OCoLC)968318147
|z (OCoLC)1082343931
|
050 |
|
4 |
|a QA315-316
|
082 |
0 |
4 |
|a 510
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Tanaev, V. S.
|q (Vi͡acheslav Sergeevich)
|1 https://id.oclc.org/worldcat/entity/E39PBJvd6ccjbGRRfWbG87PhHC
|
245 |
1 |
0 |
|a Scheduling theory. Single-stage systems /
|c by V. S. Tanaev, V. S. Gordon, and Y. M. Shafransky.
|
246 |
3 |
0 |
|a Single-stage systems
|
264 |
|
1 |
|a Dordrecht :
|b Springer Science+Business Media,
|c [1994]
|
264 |
|
4 |
|c ©1994.
|
300 |
|
|
|a 1 online resource (viii, 373 pages) :
|b illustrations, tables
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a Mathematics and Its Applications (Springer Science+Business Media) ;
|v 284
|
504 |
|
|
|a Includes bibliographic references (pages 324-353), additional bibliographical references (pages 354-365), and index.
|
505 |
0 |
0 |
|t Elements of graph theory and computational complexity of algorithms --
|t Polynomially solvable problems --
|t Priority-generating functions ;
|t Ordered sets of jobs --
|t [Italic capitals]NP-hard problems --
|g Appendix.
|t Approximation algorithms.
|
520 |
|
|
|a Scheduling theory is an important branch of operations research. Problems studied within the framework of that theory have numerous applications in various fields of human activity. As an independent discipline scheduling theory appeared in the mid-1950s, and has attracted the attention of researchers in many countries. In the early eighties a group of Byelorussian mathematicians made an attempt to give an up-to-date description of standard scheduling theory, and this book is a result of that effort. The book is devoted to the problems of finding optimal schedules for systems consisting either of a single machine or of several parallel machines. It describes in detail the most important statements and algorithms which contain typical scheduling ideas and approaches. Some propositions are accompanied by schematic proofs.
|
588 |
0 |
|
|a Print version record.
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
650 |
|
0 |
|a Production scheduling
|x Mathematical models.
|
650 |
|
6 |
|a Ordonnancement (Gestion)
|x Modèles mathématiques.
|
650 |
|
7 |
|a Production scheduling
|x Mathematical models
|2 fast
|
700 |
1 |
|
|a Gordon, V. S.
|q (Valeriĭ Sergeevich),
|e author.
|1 https://id.oclc.org/worldcat/entity/E39PCjqqd9pDFpRf8tCC4QckjC
|
700 |
1 |
|
|a Shafranskiĭ, I͡A. M.
|q (I͡Akov Mikhaĭlovich),
|e author.
|1 https://id.oclc.org/worldcat/entity/E39PCjChyqqRBFVxXqM8yXrkTb
|
776 |
0 |
8 |
|i Print version:
|a Tanaev, V. S. (Vi͡acheslav Sergeevich)
|t Scheduling Theory. Single-Stage Systems.
|d Dordrecht : Springer Netherlands, ©1994
|z 9789401045209
|
830 |
|
0 |
|a Mathematics and its applications (Springer Science+Business Media) ;
|v 284.
|
856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3566194
|z Texto completo
|
936 |
|
|
|a BATCHLOAD
|
938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL3566194
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 13330683
|
994 |
|
|
|a 92
|b IZTAP
|