Generated on Mon Nov 30 23:53:40 2009 for Gecode by doxygen 1.6.1

unary.hh File Reference

(Revision: 9878)

#include <gecode/scheduling/task.hh>
#include <gecode/scheduling/unary/task.hpp>
#include <gecode/scheduling/unary/task-view.hpp>
#include <gecode/scheduling/unary/tree.hpp>
#include <gecode/scheduling/unary/overload.hpp>
#include <gecode/scheduling/unary/subsumption.hpp>
#include <gecode/scheduling/unary/detectable.hpp>
#include <gecode/scheduling/unary/not-first-not-last.hpp>
#include <gecode/scheduling/unary/edge-finding.hpp>
#include <gecode/scheduling/unary/man-prop.hpp>
#include <gecode/scheduling/unary/opt-prop.hpp>

Go to the source code of this file.

Classes

class  Gecode::Scheduling::Unary::ManFixTask
 Unary (mandatory) task with fixed processing time. More...
class  Gecode::Scheduling::Unary::OptFixTask
 Unary optional task with fixed processing time. More...
class  Gecode::Scheduling::TaskViewTraits< Unary::ManFixTaskFwd >
 Task view traits for forward task views. More...
class  Gecode::Scheduling::TaskViewTraits< Unary::ManFixTaskBwd >
 Task view traits for backward task views. More...
class  Gecode::Scheduling::TaskViewTraits< Unary::OptFixTaskFwd >
 Task view traits for forward optional task views. More...
class  Gecode::Scheduling::TaskViewTraits< Unary::OptFixTaskBwd >
 Task view traits for backward task views. More...
class  Gecode::Scheduling::TaskTraits< Unary::ManFixTask >
 Task traits for mandatory fixed tasks. More...
class  Gecode::Scheduling::TaskTraits< Unary::OptFixTask >
 Task traits for optional fixed tasks. More...
class  Gecode::Scheduling::Unary::OmegaNode
 Node for an omega tree. More...
class  Gecode::Scheduling::Unary::OmegaTree< TaskView >
 Omega trees for computing ect of task sets. More...
class  Gecode::Scheduling::Unary::OmegaLambdaNode
 Node for an omega lambda tree. More...
class  Gecode::Scheduling::Unary::OmegaLambdaTree< TaskView >
 Omega-lambda trees for computing ect of task sets. More...
class  Gecode::Scheduling::Unary::ManProp< ManTask >
 Scheduling propagator for unary resource with mandatory tasks. More...
class  Gecode::Scheduling::Unary::OptProp< OptTask >
 Scheduling propagator for unary resource with optional tasks. More...

Namespaces

namespace  Gecode::Scheduling::Unary
 

Scheduling for unary resources.


namespace  Gecode
 

Gecode toplevel namespace.


namespace  Gecode::Scheduling
 

Scheduling constraints and branchers.


Typedefs

typedef ManFixTask Gecode::Scheduling::Unary::ManFixTaskFwd
 Forward mandatory fixed task view.
typedef FwdToBwd< ManFixTaskFwd > Gecode::Scheduling::Unary::ManFixTaskBwd
 Backward (dual) mandatory fixed task view.
typedef OptFixTask Gecode::Scheduling::Unary::OptFixTaskFwd
 Forward optional fixed task view.
typedef FwdToBwd< OptFixTaskFwd > Gecode::Scheduling::Unary::OptFixTaskBwd
 Backward (dual) optional fixed task view.

Functions

template<class ManTask >
ExecStatus Gecode::Scheduling::Unary::overload (Space &home, TaskArray< ManTask > &t)
 Check mandatory tasks t for overload.
template<class OptTask >
ExecStatus Gecode::Scheduling::Unary::overload (Space &home, Propagator &p, TaskArray< OptTask > &t)
 Check optional tasks t for overload.
template<class Task >
ExecStatus Gecode::Scheduling::Unary::subsumed (Space &home, Propagator &p, TaskArray< Task > &t)
 Check tasks t for subsumption.
template<class ManTask >
ExecStatus Gecode::Scheduling::Unary::detectable (Space &home, TaskArray< ManTask > &t)
 Propagate detectable precedences.
template<class OptTask >
ExecStatus Gecode::Scheduling::Unary::detectable (Space &home, Propagator &p, TaskArray< OptTask > &t)
 Propagate detectable precedences.
template<class ManTask >
ExecStatus Gecode::Scheduling::Unary::notfirstnotlast (Space &home, TaskArray< ManTask > &t)
 Propagate not-first and not-last.
template<class OptTask >
ExecStatus Gecode::Scheduling::Unary::notfirstnotlast (Space &home, Propagator &p, TaskArray< OptTask > &t)
 Propagate not-first and not-last.
template<class Task >
ExecStatus Gecode::Scheduling::Unary::edgefinding (Space &home, TaskArray< Task > &t)
 Propagate by edge finding.