Scheduling occurs in every organization without considering the nature of its activities. In this regard, numerous scholars have attempted to schedule via divergent methods including classical scheduling, genetic algorithm, neural network and fuzzy logic and so on. Studies in manufacturing scheduling mostly deal with priority rules without any consideration of the system states. An appropriate scheduling leads to significant enhancement of fairness in job scheduling. The term fairness can be transformed into a specific selection of job weights. There is no method of scheduling in which priority, time action (duration) and time stamp of jobs have simultaneously been considered. But the proposed method of scheduling can enhance the efficiency and reliability of manufacturing systems. To fulfill this target, first and foremost, the normalize method should be performed. This method allows data (time stamp, time action, priority) of jobs on different scales to be compared by bringing them to a common scale. Secondly, the jobs should be arranged based on three criteria which are priority, time action and time stamp. This sorting algorithm is programmed via MATLAB Distributed Computing Server (DCS) software. Eventually, to evaluate the proposed method of scheduling, simulation is operated. The simulated algorithm shows that applying the proposed method of scheduling increases the efficiency of simulated scheduler in comparison with applying the common method of scheduling. Besides the mentioned simulated algorithm, there is a mathematical proof to show the enhancement of reliability.

Efficiency is becoming a pivotal aspect in each manufacturing system and scheduling plays a crucial role in sustaining it. The applicability of distributed computing to coordinate and execute jobs has been investigated in the past literature. Moreover, it is significant that even for sensitive industrial systems the only criterion of allocating jobs to appropriate machines is the FIFO policy. On the other flip, many researchers are of the opinion that the main reason behind failing to provide fairness in distributed systems is considering the only criterion of time stamp to judge upon and form the queue of jobs with the aim of allocating those jobs to the machines. In order to increase the efficiency of sensitive industrial system, this study takes into consideration of three criteria of each job including priority, time action and time stamp. The methodology adopted by this study is definition of job scheduler and positioning jobs in temporary queue and sorting via developing bubble sort. In sorting algorithm criterion of priority, time action should be considered besides time stamp to recognize the tense jobs for processing earlier. To evaluate this algorithm first a numerical test case (simulation) is programmed and then the case study performing in order to optimize efficiency of applying this method in real manufacturing system. Eventually the results of this study provided evidence on that the rate of efficiency is increased.

No abstract

No abstract