یک مطالعه مبتنی بر شبیه سازی قوانین اعزام در یک برنامه زمانبندی شغل پویا با انتشار دسته ای و محدودیت های پیشین فنی پیشرفته

This paper considers a simulation-based analysis of dispatching rules for scheduling in a dynamic job shop with batch release taking into account the extended technical precedence constraint which is a new term defined as the extension of conventional routing-based technical precedence constraint in our paper. With respect to tardiness-related measures, the relative performances of some widely-used dispatching rules as well as four new ones proposed in our paper are evaluated for different settings of the model parameters. The results of the simulation study demonstrate the effectiveness of the four new proposed dispatching rules, and also reveal that the relative performance of dispatching rules can be affected by some model parameters. For the standard job shop scheduling problem model, where there are no extended technical precedence constraints between jobs, as well as for the models taking into account the extended technical precedence constraint, it is shown that for minimizing the total tardiness and the percentage of tardy jobs, the four new proposed dispatching rules are very effective under relatively loose due date. With respect to tardiness-related objectives, the relative performance of the analyzed dispatching rules can be affected by changing not only the levels of the extended technical precedence constraint, but also the due date tightness.