anchor.diff:  				  (setf aux-result (beam (list (problema-estado-inicial problema))))
   				  (if (null result)
   				      (setf result aux-result)
  -				     (if (funcall (is-better-solution heur) result aux-result)
  +				     (if (funcall is-better-solution-fn result aux-result)
   					 	(setf result aux-result)))
   				  (if (< beam-width max-beam-width)
   					(incf beam-width)
  
positive.code: 
  		 (result nil)
  		 (tempo 300))
  
      (labels ((beam (estados)
                (cond ((<= (- tempo (/ (- (get-internal-run-time) tempo-inicio) internal-time-units-per-second)) 0.2) (return-from beam-search result))
  		    		((funcall objectivo? (first estados)) (list (first estados)))
  
negative.code: ; Job Shop aux
  ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
  
  ;; (defstruct job-schedule 
  ;;   job-shop-problem
  ;;   best-schedule)
  
   ;Used to propagate time constraint from task precendence and machine precendence
  (defstruct job-task-w-constr
  