Time-dependent scheduling
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...
| Main Author: | Gawiejnowicz, Stanisław. |
|---|---|
| Other Authors: | SpringerLink (Online service) |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin :
Springer,
©2008.
Berlin : [2008] |
| Physical Description: |
1 online resource (xvi, 377 pages) : illustrations. |
| Series: |
Monographs in theoretical computer science.
|
| Subjects: |
Table of Contents:
- 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.