Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Markus Klinik
c2-planning-scheduling-paper
Commits
b3758c52
Commit
b3758c52
authored
May 24, 2019
by
Markus Klinik
Browse files
wording
parent
fbd5597d
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
3 additions
and
3 deletions
+3
-3
implementation.tex
implementation.tex
+3
-3
No files found.
implementation.tex
View file @
b3758c52
...
...
@@ -173,10 +173,10 @@ A disadvantage is it does not always find the schedule with the shortest makespa
It is sometimes possible to find shorter schedules by changing the order of tasks.
Consider the scenario in
\cref
{
fig:greedy-fails
}
.
There are two resources, resource A with one capability capA, and B with one capability capB.
There are three
t
asks 1, 2, and 3, where
t
ask 1 requires capA and
t
asks 2 and 3 require capB.
Furthermore,
t
ask 1 is a predecessor of
t
ask 2.
There are
the
three
T
asks 1, 2, and 3, where
T
ask 1 requires capA and
T
asks 2 and 3 require capB.
Furthermore,
T
ask 1 is a predecessor of
T
ask 2.
There exists exactly one valid assignment, namely the one used in
\cref
{
fig:greedy-fails
}
.
The greedy schedule builder processes tasks in the order in which they occur, so it fails to see that
t
ask 3 c
ould
be scheduled at time 0.
The greedy schedule builder processes tasks in the order in which they occur, so it fails to see that
T
ask 3 c
an
be scheduled at time 0.
\begin{figure}
\centering
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment