An analysis of heuristics in a dynamic job shop with weighted tardiness objectives

Meeting due dates as a reflection of customer satisfaction is one of the sc heduling criteria that is frequently encountered in today's manufacturing e nvironments. The natural quantification of this qualitative goal involves t ardiness related measures. In this study, we consider the dynamic job shop scheduling problem with the weighted tardiness criterion. After we present a comprehensive literature survey on the topic, we measure the long-run per formances of more than 20 single-pass dispatching rules under various exper imental conditions. In this study, we pay special attention to recently pro posed dispatching heuristics such as CEXSPT, CR + SPT, S/RPT + SPT, and Bot tleneck Dynamics (BD). We also investigate the effects of six resource pric ing schemes proposed recently for ED. Moreover, we extend the earlier versi ons of inserted idleness and identify the conditions in which these techniq ues can be applied without incurring too much computational cost. Future re search directions are also outlined in light of the computational results.