FICO
FICO Xpress Optimization Examples Repository
FICO Optimization Community FICO Xpress Optimization Home
Back to examples browserPrevious exampleNext example

Resource usage profiles

Description
Special cases of resource constraints:
  • residle.mos: Preemptive scheduling ('resource idle times'); definition of resource usage profiles.
  • resprofile.mos: Scheduling with resource usage profiles; 'requires' constraints with sets of 'resusage'
  • altresource.mos: Scheduling with resource choice; 'requires' constraints with sets of 'resusage'
Further explanation of this example: 'Xpress Kalis User Guide', Section 5.6 Extensions: setup times, resource choice, usage profiles

resprofidle.zip[download all files]

Source Files





altresource_graph.mos

(!****************************************************************
   CP example problems
   ===================
   
   file altresource_graph.mos
   ``````````````````````````
   Scheduling tasks with resource choice.
   - Graphical solution representation -

   (c) 2008 Artelys S.A. and Fair Isaac Corporation
       Creation: 2008, rev. Sep. 2018       
*****************************************************************!)
model "Alternative resources"
 uses "kalis", "mmsvg"
 
 setparam("KALIS_DEFAULT_LB", 0)
 
 declarations
  TASKS = {"a","b","c","d"}           ! Index set of tasks
  MACH = {"M1", "M2"}                 ! Index set of resources
  USE: array(TASKS,MACH) of integer   ! Machine-dependent res. requirement
  DUR: array(TASKS) of integer        ! Durations of tasks
 
  T: array(TASKS) of cptask           ! Tasks
  R: array(MACH) of cpresource        ! Resources
 end-declarations 

 DUR::(["a","b","c","d"])[7, 9, 8, 5]
 USE::(["a","b","c","d"],["M1","M2"])[
      4, 3,
      2, 3,
      2, 1,
      4, 5]

! Define discrete resources
 forall(m in MACH) do
  set_resource_attributes(R(m), KALIS_DISCRETE_RESOURCE, 5)
  R(m).name:=m
 end-do 

! Define tasks with machine-dependent resource usages
 forall(j in TASKS) do
  T(j).duration:= DUR(j)
  T(j).name:= j
  requires(T(j), union(m in MACH) {resusage(R(m), USE(j,m))})   
 end-do

 cp_set_solution_callback("print_solution")   
 starttime:=timestamp

! Solve the problem
 if cp_schedule(getmakespan)=0 then
  writeln("No solution")
  exit(0)
 end-if

! Solution printing
 forall(j in TASKS)
  writeln(j, ": ", getsol(getstart(T(j))), " - ", getsol(getend(T(j))))
 forall(t in 1..getsol(getmakespan)) do
  write(strfmt(t-1,2), ": ")

  ! We cannot use 'getrequirement' here to access solution information
  ! (it returns a value corresponding to the current state, that is 0)
  forall(j in TASKS | t>getsol(getstart(T(j))) and t<=getsol(getend(T(j)))) 
   write(j, ":", 
         sum(m in MACH) USE(j,m)*getsol(getassignment(T(j),R(m))), "  " )
  writeln
 end-do   

! ****************************************************************

! Print solutions during enumeration at the node where they are found
 public procedure print_solution    
  writeln(timestamp-starttime, "sec. Solution: ", getsol(getmakespan))

  forall(m in MACH) do
   writeln(m, ":")

   forall(t in 0..getsol(getmakespan)-1) do
    write(strfmt(t,2), ": ")
    forall(j in TASKS | getrequirement(T(j), R(m), t)>0) 
     write(j, ":", getrequirement(T(j), R(m), t), "  " )
    writeln(" (total ", sum(j in TASKS) getrequirement(T(j), R(m), t), ")" )
   end-do

  end-do 
 end-procedure

! ************ Drawing a resource usage diagram ************

 L:=maxlist(15,getsol(getmakespan))
 C:=5

 ct:=-1
 forall(m in MACH, ct as counter) do
  svgaddgroup(m, "Resource "+m, svgcolor(255,255-50*ct,200-75*ct))
  svgsetstyle(SVG_FILL,SVG_CURRENT)
  svgaddpolygon([0, C*ct]+sum(t in 0..L) [t, getcapacity(R(m),t)+C*ct]+ [L,C*ct])
 end-do
 
 declarations
  TLIST: list of string
 end-declarations 	

 ! Task graph colors
 ct:= 0
 forall(j in TASKS, ct as counter) do
  svgaddgroup(j, "Task "+j, svgcolor(75+ct*25, 75+ct*25, minlist(100+ct*50,255)))
  svgsetstyle(SVG_FILL,SVG_CURRENT)
 end-do

 ! Order tasks by start times to obtain a nicer graph
 TCopy:= TASKS
 while (TCopy<>{}) do
  val:=L
  forall(j in TCopy)
   if getsol(getstart(T(j)))<val then
    val:=getsol(getstart(T(j)))
    ind:=j
   end-if 
  TLIST += [ind]
  TCopy-= {ind}
 end-do 

 ! Drawing task graphs
 forall(t in 1..L) do
  ct:=-1
  forall(m in MACH, ct as counter) do
   CUM:=ct*C

  ! We cannot use 'getrequirement' here to access solution information
  ! if this graph is not drawn directly at the solution node
   forall(j in TLIST | getsol(getassignment(T(j),R(m)))>0 and
                       t>getsol(getstart(T(j))) and t<=getsol(getend(T(j))) ) do
    REQ:= USE(j,m)*getsol(getassignment(T(j),R(m)))
!    svgaddrectanglec(j, t-1, CUM, t, CUM+REQ)
    svgaddrectangle(j, t-1, CUM, 1, REQ)
    CUM+= REQ
   end-do 
  end-do
 end-do 
 
 svgsetgraphscale(20)
 svgsetgraphviewbox(0,0,L,2*C+1)
 svgsetgraphlabels("Time", "Resource usage")

 svgsave("altres.svg")
 svgrefresh
 svgwaitclose("Close browser window to terminate model execution.", 1)

end-model

Back to examples browserPrevious exampleNext example