[jboss-svn-commits] JBL Code SVN: r34161 - labs/jbossrules/trunk/drools-docs/drools-docs-planner/src/main/docbook/en-US/Chapter-Planner_introduction.

[jboss-svn-commits at lists.jboss.org]

Author: ge0ffrey
Date: 2010-07-26 02:32:54 -0400 (Mon, 26 Jul 2010)
New Revision: 34161

Modified:
   labs/jbossrules/trunk/drools-docs/drools-docs-planner/src/main/docbook/en-US/Chapter-Planner_introduction/Chapter-Planner_introduction.xml
Log:
better use cases + experiment for JBRULES-2581 with listitems

Modified: labs/jbossrules/trunk/drools-docs/drools-docs-planner/src/main/docbook/en-US/Chapter-Planner_introduction/Chapter-Planner_introduction.xml
===================================================================
--- labs/jbossrules/trunk/drools-docs/drools-docs-planner/src/main/docbook/en-US/Chapter-Planner_introduction/Chapter-Planner_introduction.xml	2010-07-26 05:08:57 UTC (rev 34160)
+++ labs/jbossrules/trunk/drools-docs/drools-docs-planner/src/main/docbook/en-US/Chapter-Planner_introduction/Chapter-Planner_introduction.xml	2010-07-26 06:32:54 UTC (rev 34161)
@@ -14,42 +14,32 @@
 
     <itemizedlist>
       <listitem>
-        <para>Employee shift rostering</para>
+        <para>Employee shift rostering, such as nurse rostering</para>
       </listitem>
 
       <listitem>
-        <para>Freight routing</para>
+        <para>Verhicle routing, freight routing and people routing, such as <link
+        xlink:href="http://en.wikipedia.org/wiki/Travelling_salesman_problem">The traveling salesman problem</link> and
+        <link xlink:href="http://mat.gsia.cmu.edu/TOURN/">The traveling tournament problem</link></para>
       </listitem>
 
       <listitem>
-        <para>Supply sorting</para>
+        <para>Educational timetabling, such as lesson scheduling, course schedule, exam scheduling and conference
+        scheduling</para>
       </listitem>
 
       <listitem>
-        <para>Lesson or course scheduling</para>
+        <para>Bin packaging, stock sorting and storage organizing</para>
       </listitem>
 
       <listitem>
-        <para>Exam scheduling</para>
+        <para>Machine queue planning</para>
       </listitem>
 
       <listitem>
-        <para>Bin packaging</para>
+        <para>Miss manners too (although the Drools Planner example solves this differently than the pure Drools Expert
+        example)</para>
       </listitem>
-
-      <listitem>
-        <para><link xlink:href="http://en.wikipedia.org/wiki/Travelling_salesman_problem">The traveling salesman
-        problem</link></para>
-      </listitem>
-
-      <listitem>
-        <para><link xlink:href="http://mat.gsia.cmu.edu/TOURN/">The traveling tournament problem</link></para>
-      </listitem>
-
-      <listitem>
-        <para>Miss manners too (although the Drools Planner example solves this differently than the pure Drools rule
-        engine example)</para>
-      </listitem>
     </itemizedlist>
 
     <para>A planning problem consists out of a number of constraints. Generally, there are 3 types of
@@ -203,6 +193,6 @@
     <para>Check <link xlink:href="http://blog.athico.com/search/label/planner">our blog</link> and twitter (<link
     xlink:href="http://twitter.com/geoffreydesmet">Geoffrey</link>) for news. If Drools Planner helps you, don't forget
     to blog or to <link xlink:href="http://twitter.com/#search?q=%23DroolsPlanner">twitter (hashtag
-    #DroolsPlanner)</link> about it yourself!</para>
+    #DroolsPlanner)</link> about it!</para>
   </section>
 </chapter>