sample Algorithmus
Use this algorithm to solve a open shop
problem with Cmax objective heuristcally.
This algorithm is for problems with unit
processing times exact.
What you have to do::
Make sure that both a
problem type and all
parameters
are defined. Choose Heuristic Algorithms|rank minimal schedule from
the menu Algorithms and after editing the options press OK.
Options:
- test parameter
- this entry demonstrates the parameter handling
Problems:
- The result of this algorithm is for some O/p_ij=1/Cmax problems with
complete operation set not optimal.
Table of Contents
10.10.2001 LiSA