algorithms/SPDM.h Source File

00001 /***************************************************************************
00002                           SPDM.h  -  description
00003                              -------------------
00004     begin                : Die Jan 14 2003
00005     copyright            : (C) 2003 by LEA / TUM
00006     email                : taeubig@in.tum.de
00007  ***************************************************************************/
00008 
00009 #ifndef SPDM_H
00010 #define SPDM_H
00011 
00012 #include <utility>
00013 #include <LEDA/list.h>
00014 
00015 #include "SSchedAlgorithm.h"
00016 #include "BinTree.h"
00017 
00018 using std::pair;
00019 
00024 class SPDM : public SSchedAlgorithm  {
00025 public: 
00026   virtual ~SPDM() {};
00027   virtual void startup();
00028   virtual double innerLoop(const leda_list<STSysSchedEvent>& rEvents);
00029   virtual const leda_string getDescription() const;
00030   virtual const leda_string &getName() const;
00031   virtual const SClassification &getClassification() const;
00032   virtual SLeaBibEntry &getLeaBibEntry() const;
00033 
00034 private:
00035   leda_list<SJob*> m1_list;
00036   leda_list<SJob*> m2_list;
00037   leda_list< pair<SJob*, int*> > job_list;
00038   
00040   BinTree* difference(leda_list< pair<SJob*, int*> > l);
00041   
00043   void selectMachines(knot* k, int m);
00044 
00045 };
00046 
00047 #endif