Comparative Analysis of the Scheduling Rule Shortest Processing Time Truncated with Four Other Due Date-oriented Scheduling Rules in a Simulated Job Shop |
Common terms and phrases
A. K. Erlang amount of truncation average shop utilization average utilization CALIFORN COMPUTER OUTPUT Conway Conway's composite procedure criteria of performance DIFFERENT RULES TESTED dispatching rule DISTRIBUTION AT 70 due date oriented due date tightness expected waiting experimental surface Figure higher moments hypotheses infinite moment intermediate moments job shop jobs tardy level of truncation loose due dates machine center maximum tardiness mean tardiness minimize multiplied by 1010 normal due dates NORMALIZED SCALE 20.00 number of jobs number of operations obtained Oldziey's composite procedure OUTPUT FOR DIFFERENT parameter percentage of jobs primary rule SPT priority rule problem queue system queuing theory remaining slack RESPECT TO SELECTED rule COVERT rule SPT-T scheduling rule SPT SELECTED MOMENTS sequencing Shortest Processing simulation slack per operation SPT-T WITH RESPECT tardiness distribution tardy jobs TESTED AT 50 tight due dates TRUNCATION EXPERIENCED truncation levels truncation process UTILIZATION UNDER LOOSE UTILIZATION UNDER TIGHT waiting lines zero