TRA CỨU
thông tin biểu ghi
  • VN Book Drive
  • Ký hiệu PL/XG: 004.3 G284
    Nhan đề: Time-dependent scheduling /
ISBN 9783540694458
DDC 004.3
Tác giả CN Gawiejnowicz, Stanisław
Nhan đề Time-dependent scheduling / Stanislaw Gawiejnowicz
Thông tin xuất bản Berlin : Springer, 2008.
Mô tả vật lý xvi, 377 pages. : illustrations ; 24 cm.
Tùng thư Monographs in theoretical computer science.
Tóm tắt Hebookpresentedtothereaderisdevotedtotime-dependentscheduling. TScheduling problems, in general, consist in the allocation of resources over time in order to perform a set of jobs. Any allocation that meets all requirements concerning the jobs and resources is called a feasible schedule. The quality of a schedule is measured by a criterion function. The aim of scheduling is to?nd, among all feasible schedules, a schedule that optimizes the criterion function. A solution to an arbitrary scheduling problem consists in giving a polynomial-time algorithm generating either an optimal schedule or a schedule that is close to the optimal one, if the given scheduling problem has been proved to be computationally intractable. The scheduling problems are subject of interest of the scheduling theory, originated in mid-?fties of the twentieth century. The theory has been developing dynamically and new research areas constantly come into existence. The subject of this book, ti- dependent scheduling, is one of such areas. In time-dependent scheduling, the processing time of a job is variable and depends on the starting time of the job. This crucial assumption allows us to apply the scheduling theory to a broader spectrum of problems. For example, in the framework of the time-dependent scheduling theory we may consider the problems of repayment of multiple loans,?re?ghting and maintenance assignments. In this book, we will discuss algorithms and complexity issues concerning various time-dependent scheduling problems.
Thuật ngữ chủ đề Computer algorithms
Thuật ngữ chủ đề Mathematical optimization
Thuật ngữ chủ đề Computer capacity-Planning
Thuật ngữ chủ đề Production scheduling
Từ khóa tự do Computer science
Từ khóa tự do Artificial intelligence
Từ khóa tự do Information theory
Từ khóa tự do Computer software
Khoa Khoa Công nghệ Thông tin
Địa chỉ 300Q12_Kho Mượn_02(1): 073531
000 00000nam#a2200000u##4500
00125124
00215
0040C6A0472-35EC-4649-B1D2-036A1ADA05FF
005202010231613
008201023s2008 gw eng
0091 0
020 |a9783540694458
039|a20201023161330|bnghiepvu|y20201023161127|znghiepvu
040 |aNTT
041 |aeng
044 |agw
082 |a004.3 |bG284|223
100 |aGawiejnowicz, Stanisław
245 |aTime-dependent scheduling / |cStanislaw Gawiejnowicz
260 |aBerlin : |bSpringer, |c2008.
300 |axvi, 377 pages. : |billustrations ; |c24 cm.
490 |aMonographs in theoretical computer science.
504 |aIncludes bibliographical references (pages 341-356) and index.
520 |aHebookpresentedtothereaderisdevotedtotime-dependentscheduling. TScheduling problems, in general, consist in the allocation of resources over time in order to perform a set of jobs. Any allocation that meets all requirements concerning the jobs and resources is called a feasible schedule. The quality of a schedule is measured by a criterion function. The aim of scheduling is to?nd, among all feasible schedules, a schedule that optimizes the criterion function. A solution to an arbitrary scheduling problem consists in giving a polynomial-time algorithm generating either an optimal schedule or a schedule that is close to the optimal one, if the given scheduling problem has been proved to be computationally intractable. The scheduling problems are subject of interest of the scheduling theory, originated in mid-?fties of the twentieth century. The theory has been developing dynamically and new research areas constantly come into existence. The subject of this book, ti- dependent scheduling, is one of such areas. In time-dependent scheduling, the processing time of a job is variable and depends on the starting time of the job. This crucial assumption allows us to apply the scheduling theory to a broader spectrum of problems. For example, in the framework of the time-dependent scheduling theory we may consider the problems of repayment of multiple loans,?re?ghting and maintenance assignments. In this book, we will discuss algorithms and complexity issues concerning various time-dependent scheduling problems.
541 |aDự án VN Book Drive
650 |aComputer algorithms
650 |aMathematical optimization
650 |aComputer capacity|xPlanning
650 |aProduction scheduling
653 |aComputer science
653 |aArtificial intelligence
653 |aInformation theory
653 |aComputer software
690 |aKhoa Công nghệ Thông tin
852|a300|bQ12_Kho Mượn_02|j(1): 073531
8561|uhttp://elib.ntt.edu.vn/documentdata01/2 tailieuthamkhao/000 tinhocthongtin/anhbiasach/25124_time-dependent schedulingthumbimage.jpg
890|a1|b0|c0|d0
Dòng Mã vạch Nơi lưu S.gọi Cục bộ Phân loại Bản sao Tình trạng Thành phần Đặt chỗ
1 073531 Q12_Kho Mượn_02 004.3 G284 Sách mượn tại chỗ 1

Không có liên kết tài liệu số nào