This research is conducted particularly for the job- shop problem. The objective of the study is to devise a new job sequencing priority rule for minimizing mean WIP and mean tardiness measures.
The priority rule is modified from a traditional branch-and-bound method. Four types of due-date assignment rules have been investigated for three kinds of shop problems with two different exponential interarrival rates. The new priority rule is compared with other two basic priority rules: SPT and S/OPN priority rules.
To implement the experiment, a simulation model was developed in SIMAN simulation language. The performance of the rule was measured in terms of the weighted sum of the mean WIP and the mean tardiness which were functions of waiting time in the queue.