Design of efficient job shop scheduling rules.pdfVIP

DESIGN OF EFFICIENT JOB SHOP SCHEDULING RULES O Holthaus Department of Pro duction and Op erations Management Faculty of Business Administration and Economics University of Passau DrHansKapngerStr D Passau Germany ABSTRACT This pap er considers the design and simulationbased analysis of dispatching rules for sche duling in dynamic job shops Based up on the combination of wellknown rules new sche duling rules are develop ed For evaluating the relative p erformance of the dispatching rules the criteria of mean and maximum owtime variance of owtime mean and maximum tar diness p ercentage of tardy jobs and variance of tardiness have b een chosen The results of the simulation study reveal that the simple structured combination rules are quite ecient KEYWORDS Job shop scheduling dispatching rules combination rules owtime tardiness simulation THE DYNAMIC JOB SHOP SCHEDULING PROBLEM The dynamic job shop scheduling problem may b e characterized as follows In a manu facturing system which comprises M machines work stations jobs arrive continuously over time Each job consists of a sp ecied set of op erations which have to b e p erformed in a sp ecied sequence routing on the machines Schedules for pro cessing the jobs on each of the M machines have to b e found which are b est solutions with resp ect to given owtime or duedatebased ob jectives The mo del for this job shop scheduling problem is based on the following standard assumptions Baker Haupt Ramasesh All machines are continuously available Each machine pro cesses only one job at a time Each job can b e pro cessed by only one machine