Main Article Content
This paper deals with minimization of maximum expected cost for scheduling problem with stochastic processing time .The longest delay time and Earliest finished time are the goal of a mathematical strategy. Many factors influence the deterministic processing times of tasks in any manufacturing challenge, including machinery, manpower, maintenance time, climate, and current supplies . Many different types of oscillating machines are available in most companies to perform machine operations on small-scale jobs. Shapers, broaching machines, and planners are frequently used for cutting a small field of research in low volume. These tools are used to create very small areas of cutting, perpendicular, curved, and plain surfaces. The goal function is to assign ten different jobs in a shaper machine set up to reduce the overall estimated cost, and to find the best suited sequential order to complete the task in minimum time. Furthermore, the importance of the stochastic approach is determined by comparing the findings to those obtained using the deterministic method. Finally, a number of heuristic techniques are proposed to generate close solutions, which are demonstrated to be very precise and cost-effective by trials using the Excel solver.