Heuristic Procedure on General n/m Job-Shop Scheduling Generation

The general n/m job-shop problem is easy to state what is required, but it is extremely difficult to make any progress whatever toward a solution. This paper was first to examine a heuristic procedure of general n/m scheduling generation focused on the procedure of MWRK (Most Work Remaining) presented by Giffler and Thompson (1960) among others. Then modified procedure was proposed to obtain better solution in light of the key measure of performance compared with that of the literature presented by Baker (1974). The modified procedure then has been extended to other example problem to test the better results and to assure the properness of application.