[education/kstars] doc: Fix XML

[Yuri Chornoivan]

Git commit 179c4d0cf359191ffef04707837bb8ba70c6a399 by Yuri Chornoivan.
Committed on 04/07/2023 at 03:40.
Pushed by yurchor into branch 'master'.

Fix XML

M  +1    -1    doc/ekos-scheduler.docbook

https://invent.kde.org/education/kstars/-/commit/179c4d0cf359191ffef04707837bb8ba70c6a399

diff --git a/doc/ekos-scheduler.docbook b/doc/ekos-scheduler.docbook
index e567f5b3c..d07135377 100644
--- a/doc/ekos-scheduler.docbook
+++ b/doc/ekos-scheduler.docbook
@@ -69,13 +69,13 @@
         <para>
           When the scheduler starts (or when it replans, which it does every second while active), it looks through the entire list of jobs, starting at the highest priority job, and working its way down to the lowest priority one if necessary. When it finds a job that can run, it starts that job, possibly preempting the currently running job. A jobs can run if it's constraints are met, e.g. the target is not blocked by the local terrain, it meets the minimum altitude constraint, it has not already completed all the desired imaging, ...
         </para>
-    </sect3>
     <para>
       The algorithm shows its projected next start times and stop times for all job in the Scheduler table. It also shows its estimate of times jobs will run during the next 48 hours in the log panel at the bottom of the window. See the screenshot of the scheduler window at the top of this section.
         </para>
         <para>
           The scheduling algorithm described in the above paragraph is known as the Greedy Scheduling algorithm. It is the recommended one to use. In previous versions of Ekos, there was another "Classic scheduling algorithm" which is currently being phased out. That scheme could not preempt running jobs, and thus did not makes as much use of the equipment as the Greedy Algorithm. 
         </para>
+    </sect3>
     <sect3 id="scheduler-files">
         <title>Scheduler Files (.esq)</title>
         <para>