The scheduling problem of N independent works on M machines in the environment of permutation workflow workshop along with processing time and the desired delivery date are types of static problems, and except the machinery limitation as resources, no other limitation governs on it. Due to the importance of on time completion of work and minimizing delivery time of work, checking them is necessary in real word situations and will be properly effective on orders expedition and customer satisfaction. In this paper, one purpose of minimizing the sum of delays and on times (ΣE/T), is factor of recourses in advance reservation. The other main purpose is to present a new method called TIME_GSA using the Gravitational Search Algorithm (GSA) in order to solve the scheduling problem of works in workflow workshop environment, based on minimizing criteria of the sum of works delays and on times for resources in advance reservation. In this article, a novel optimization algorithm in the basis of gravitation law and mass interactions is presented to resolve the above problem. The suggested algorithm utilizes two of four basic factors connected to velocity and gravitational force in physics, based on random search concepts. The searcher agents are a group of masses which interact with each other based on the Newtonian gravitation and the laws of motion. The suggested procedure is compared with GA algorithm; the results approve the excellent performance of the suggested procedure to resolve the above problem.
Blind signatures, introduced by Chaum, allow a user to obtain a signature on a message without revealing any thing about the message to the signer. Blind signatures play an important role in plenty of applications such as e-voting, e-cash system where anonymity is of great concern. Identity based(ID-based) public key cryptography can be a good alternative for certificate based public key setting, especially when efficient key management and moderate security are required. In this paper, we propose an ID-based blind signature scheme from bilinear pairings. The proposed scheme is based on the Hess ID- based digital signature scheme. Also we analyze security and efficiency of the proposed scheme.
In flexible manufacturing systems (FMS), each job is formed of a set of operations that should be executed consecutive. Determining the sequence of operations and assigning proper machine to each operation are two important problems in scheduling FMS's. This is an NP-hard problem. Recently using heuristic methods, numerous algorithms are presented for solving this problem. In this paper for scheduling of flexible manufacturing systems, a new algorithm called hybrid genetic algorithm-Petri net (HGA-PN) is presented using timed Petri net and combinational genetic algorithm. In our purposed algorithm, first the flexible manufacturing system is modeled by using timed Petri net, and then an appropriate scheduling is manufactured using combinational genetic algorithm. The experimental results illustrates that our proposed algorithm has higher efficiency over other existing algorithms.