Implementation of job-shop scheduling rules in textile industry

Abstract

The work on machine scheduling problem of a large textile mill is reported in this thesis. Scheduling programs are prepared daily and present orders are taken into consideration. We can look at this problem as a static job-shop problem. Main objectives of this research are to study the minimization of the average tardiness of orders, the variance of tardiness and the work-in-process inventory of the factory. For this purpose, Shortest-Processing-Time Rule with Truncation Process has been choosen as the best rule in meeting the main objectives, in the light of previous researches. Series of interactive programs have been written in order to update the necessary changes in the status of orders and machines easily. After a short education users will be able to use this program efficiently.