/usr/share/mozart/doc/fdt/node46.html is in mozart-doc 1.4.0-8ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 | <!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD><TITLE>11 Scheduling</TITLE><LINK href="ozdoc.css" rel="stylesheet" type="text/css"></HEAD><BODY><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node43.html#chapter.bab"><< Prev</A></TD><TD><A href="index.html">- Up -</A></TD><TD><A href="node52.html#appendix.traps">Next >></A></TD></TR></TABLE><DIV id="chapter.scheduling"><H1><A name="chapter.scheduling">11 Scheduling</A></H1><P> In this section we will consider examples of scheduling problems. Scheduling in this tutorial means to compute a timetable for tasks competing for a given set of resources. We assume that the execution of a task can not be interrupted (that is, no preemption is allowed). </P><HR><UL class="toc"><LI><A href="node47.html#section.scheduling.house">11.1 Building a House</A><UL class="toc"><LI><A href="node47.html#label127">Problem Specification</A></LI><LI><A href="node47.html#sec.precedence">11.1.1 Building a House: Precedence Constraints</A><UL class="toc"><LI><A href="node47.html#label128">Model</A></LI><LI><A href="node47.html#label131">Distribution Strategy</A></LI><LI><A href="node47.html#label132">Script</A></LI></UL></LI><LI><A href="node47.html#sec.bahcc">11.1.2 Building a House: Capacity Constraints</A><UL class="toc"><LI><A href="node47.html#label136">Model</A></LI><LI><A href="node47.html#label140">Distribution Strategy</A></LI><LI><A href="node47.html#page.tasksonres">Script</A></LI></UL></LI><LI><A href="node47.html#sec.serializers">11.1.3 Building a House: Serializers</A><UL class="toc"><LI><A href="node47.html#label143">Ordering Tasks by Distribution</A></LI><LI><A href="node47.html#label145">Script</A></LI></UL></LI></UL></LI></UL><UL class="toc"><LI><A href="node48.html#section.scheduling.bridge">11.2 Constructing a Bridge</A><UL class="toc"><LI><A href="node48.html#label147">Problem Specification</A></LI><LI><A href="node48.html#label148">Model</A></LI><LI><A href="node48.html#label149">Distribution Strategy</A></LI><LI><A href="node48.html#label150">Script</A></LI></UL></LI></UL><UL class="toc"><LI><A href="node49.html#section.scheduling.edgefinding">11.3 Strong Propagators for Capacity Constraints </A></LI></UL><UL class="toc"><LI><A href="node50.html#section.scheduling.strongser">11.4 Strong Serializers</A></LI></UL><UL class="toc"><LI><A href="node51.html#section.scheduling.hard">11.5 Solving Hard Scheduling Problems</A><UL class="toc"><LI><A href="node51.html#label160">11.5.1 The Problem ABZ6</A></LI><LI><A href="node51.html#label162">11.5.2 The MT10 Problem</A></LI></UL></LI></UL></DIV><TABLE align="center" border="0" cellpadding="6" cellspacing="6" class="nav"><TR bgcolor="#DDDDDD"><TD><A href="node43.html#chapter.bab"><< Prev</A></TD><TD><A href="index.html">- Up -</A></TD><TD><A href="node52.html#appendix.traps">Next >></A></TD></TR></TABLE><HR><ADDRESS><A href="http://www.ps.uni-sb.de/~schulte/">Christian Schulte</A> and <A href="http://www.ps.uni-sb.de/~smolka/">Gert Smolka</A><BR><SPAN class="version">Version 1.4.0 (20110908185330)</SPAN></ADDRESS></BODY></HTML>
|