Time-dependent scheduling (Q938826): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:42, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Time-dependent scheduling |
scientific article |
Statements
Time-dependent scheduling (English)
0 references
28 August 2008
0 references
In the book under review, the author first introduces the basic concepts of scheduling and complexity theory. Then the central chapter treats single machine problems with time-dependent processing times (e.g. \(pj(t)=bj.t)\). A comprehensive complexity table is provided giving an overview of these single machine problems. Afterwards parallel machine problems and some dedicated time-dependent problems are presented. This theoretical parts treat mainly complexity results. Then some algorithmic approaches are developed -- mainly heuristics and near-optimal solutions (using e.g. local search). At the end of the book some adnvanced topics (like two-criterion problems) are summarized. All in all the book gives an deep overview for all kind of time-dependent scheduling problems with a central focus on complexity.
0 references
time-dependent data complexity
0 references
algorithms
0 references
heuristics
0 references
scheduling
0 references