JOB SEQUENCING

Abstract

In a manufacturing organisation, the •equeno-ing of production operations is a unifying managerial decision making problem ehiah relates to various diverse elements of organisation such as sale cost# control, capital budgeting etc. Actual decisions obtained from this problem involve spending several hundred thousand rupees and vitally affect the future operating costs and effioten©y of a manufacturing organization. There«» foremanagement is highly motivated to find the optimal sequence of the production operation. In this thesis, the sequencing problem regarding single machine and multiple Jobs has been considered, When setup and processingcost or time for eachjob to be processed on a single machine dt ffer, the sequencing problem requires the minimization of setup and processing cost or time. In chapter three this minimisation problem is formulated as shortest path problem. A modified 3~►opt method is presented for the solution of the shortest path problem.