《2016 Efficient dispatching rules for dynamic job shop scheduling》.pdf

Int J Adv Manuf Technol (2004) 24: 70–75 DOI 10.1007/s00170-002-1534-5 ORIGINAL ARTICLE P. D. D. Dominic Æ S. Kaliyamoorthy M. Saravana Kumar Efficient dispatching rules for dynamic job shop scheduling Received: 9 July 2002 / Accepted: 16 September 2002 / Published online: 11 May 2004 Springer-Verlag London Limited 2004 Abstract This study attempts to provide efficient dis- task allocation as well as the determination of process patching rules for dynamic job shop scheduling by commencement and completion times i.e., time-tabling combining different dispatching rules. A dispatching rule [2]. Sequencing problems occur whenever there is a is used to select the next job to be processed from a set of choice concerning the order in which a group of tasks jobs awaiting service. A job shop will be treated as dy- can be performed. The shop supervisor or scheduler can namic, when conditions such as continuously arriving deal with sequencing problems in a variety of ways. The new jobs and deviations from current schedule need to simplest approach is to ignore the problem and accom- be accommodated, and a job shop should be treated as plish the tasks in any random order. The most an integrated part of a manufacturing system. The dis- frequently used approach is to schedule heuristically cussion includes a simulation technique which uses according to predetermined ‘‘rules of thumb’’. In certain ARENA 4.0. software to simulate the dynamic model of cases, scientifically derived scheduling procedures can be a job shop under various rules and performance mea- used to optimise the scheduling objectives. sures . Results of the simulation show that, for most of Measures considered in this paper include [1]: t