Efficient dispatching rules for dynamic job shop scheduling

P.D.D., Dominic and Kaliamoorthy, S and Saravana kumar, M (2004) Efficient dispatching rules for dynamic job shop scheduling. [Citation Index Journal]

[img] PDF - Published Version
Restricted to Registered users only



Abstract This study attempts to provide efficient dispatching rules for dynamic job shop scheduling by combining different dispatching rules. A dispatching rule is used to select the next job to be processed from a set of jobs awaiting service. A job shop will be treated as dynamic, when conditions such as continuously arriving new jobs and deviations from current schedule need to be accommodated, and a job shop should be treated as an integrated part of a manufacturing system. The discussion includes a simulation technique which uses ARENA 4.0. software to simulate the dynamic model of a job shop under various rules and performance measures . Results of the simulation show that, for most of the performance measures, combined rules perform well. In this study, the combined rules MWKR_FIFO and TWKR_SPT do well under most conditions

Item Type:Citation Index Journal
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments / MOR / COE:Departments > Computer Information Sciences
ID Code:3446
Deposited By: Assoc Prof Dr Dhanapal Durai Dominic P
Deposited On:21 Dec 2010 02:57
Last Modified:19 Jan 2017 08:27

Repository Staff Only: item control page

Document Downloads

More statistics for this item...