MINIMIZING THE WEIGHTED NUMBER OF TARDY JOBS ON MULTIPLE MACHINES: A REVIEW

We provide an overview of the history, the methods and the people who researched on minimizing the (weighted) number of tardy jobs as a performance measure. The review presents cases on multiple machines: parallel machines (including the identical, uniform and unrelated machines, flow shop, job shop and the open shop). The literature is divided into various sections for proper categorization. This includes setup time, preemption, batching, on-line and off-line scheduling, and other classifications. The complexity status of the various classifications is enumerated with its results and methods. Possible extension for future work is also highlighted.