English to Polish Other Mathematics & Statistics

Also, [13] analysed effects of machine breakdowns and processing time variability on the quality of job shop schedules using slack-time based robustness measure. The performance of simple dispatching heuristics versus algorithmic solution techniques in job shops subjected to uncertain processing times were studied by [14] and [15] showed that dispatching rules are more robust to interruptions than the optimum seeking off-line scheduling algorithms. Reference [16] proposed a two step algorithm based on disjunctive graph representation to minimize maximum lateness and absorb the impact of random machine breakdowns on the predictive schedule of a job shop by inserting idle time. Furthermore, [17] and [18] used GA (proposed in [19]) to improve the robustness and flexibility of the job shop schedules when minimizing maximum tardiness, summed tardiness and total flow-time measures using two robustness measures, a neighbourhood-based robustness measure and a lateness-based robustness measure.