Abstract
Random Scheduling (RS) and Random Sample Scheduing (RSS) were applied to the static two-machine schedulg problems in minimizing a makespan. It was clarified that RS provided a high degree of approxiamtion in some job-shop cases and that in flow-shop cased, RS did not provie a high degree of approximation but decreased a required number of buffer capacity. A number of samples necessary for making a degree of approximatin in RSS higher than an aspiration level was derived through analytical methods. A new method of RSS was proposed on teh basis of these results and its usufulness was demonstrated through a numerical example.
