Realization of an Optimal Schedule for the Two-machine Flow-Shop with Interval Job Processing Times

Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs is studied. In an uncertain version of a scheduling problem, there may not exist a unique schedule that remains optimal for all possible realizations of the job processing times. We find necessary and sufficient conditions (Theorem 1) when there exists a dominant permutation that is optimal for all possible realizations of the job processing times. Our computational studies show the percentage of the problems solvable under these conditions for the cases of randomly generated instances with n ≤ 100 . We also show how to use additional information about the processing times of the completed jobs during optimal realization of a schedule (Theorems 2 – 4). Computational studies for randomly generated instances with n ≤ 50 show the percentage of the two- machine flow-shop scheduling problems solvable under the sufficient conditions given in Theorems 2 – 4.

One Application of the Informatics in the Descriptive Geometry

This work acquaints with a program for interactive computer training to students on the subject "Mutual intersecting of pyramids in axonometry ”. Our software is a set of three modules, which we call "student", "teacher" and "autopilot". It gives the final solution of the problem, the traceability of various significant moments in its solution and 3D-image of the finished composition of the two intersecting polyhedra, stripped of the working lines and subjected to rotation and translation.