Optimistic and Pessimistic Result of Planning and Scheduling Dynamic Processes
The combinatorial optimization is aimed at finding the optimum sequence for a given form of the performance index. This paper deals with the problems of combinatorics optimization. Here are set forth three forms of the performance index for the optimization tasks. We can consider the scheduling prob...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH University of Science and Technology Press
1999-01-01
|
| Series: | Computer Science |
| Subjects: | |
| Online Access: | http://www.csci.agh.edu.pl/11/1/cs1999%2D02.pdf |