Matrices in shop schedulding problems
Year of publication: |
2006
|
---|---|
Authors: | Bräsel, Heidemarie |
Published in: |
Perspectives on operations research : essays in honor of Klaus Neumann. - Wiesbaden : Deutscher Universitäts-Verl., ISBN 3-8350-0234-1. - 2006, p. 17-41
|
Subject: | Scheduling-Verfahren | Scheduling problem | Lineare Algebra | Linear algebra |
-
Recognising permuted Demidenko matrices
Çela, Eranda, (2023)
-
Computing project makespan distributions : Markovian PERT networks revisited
Burgelman, Jeroen, (2019)
-
Iterative solution of large linear systems
Young, David, (1971)
- More ...
-
Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
Bräsel, Heidemarie, (2008)
-
LiSa : a library of scheduling algorithms ; version 2.3
Bräsel, Heidemarie, (2003)
-
On the open-shop problem with preemption and minimizing the average completion time
Bräsel, Heidemarie, (2004)
- More ...