Time-Dependent Scheduling
By: Gawiejnowicz, Stanisław [author.].
Contributor(s): SpringerLink (Online service).
Material type:
BookSeries: Monographs in Theoretical Computer Science, An EATCS Series: Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.Description: XVI, 380 p. 26 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540694465.Subject(s): Computer science | Operations research | Decision making | Computer programming | Computers | Algorithms | Artificial intelligence | Mathematical optimization | Computer Science | Theory of Computation | Programming Techniques | Algorithm Analysis and Problem Complexity | Optimization | Artificial Intelligence (incl. Robotics) | Operation Research/Decision TheoryDDC classification: 004.0151 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
E books
|
PK Kelkar Library, IIT Kanpur | Available | EBK3126 |
Fundamentals -- Preliminaries -- Problems and algorithms -- NP-complete problems -- Basics of the scheduling theory -- Basics of time-dependent scheduling -- Complexity -- Single-machine time-dependent scheduling -- Parallel-machine time-dependent scheduling -- Dedicated-machine time-dependent scheduling -- Algorithms -- Approximation and heuristic algorithms -- Greedy algorithms based on signatures -- Local search algorithms -- Advanced Topics -- Matrix methods in time-dependent scheduling -- Scheduling dependent deteriorating jobs -- Time-dependent scheduling with two criteria.
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.
There are no comments for this item.