Scheduling Of Production Case Study

2076 Words5 Pages

Scheduling of production plays an important role in the scheduling and planning of modern manufacturing systems [1]. Production scheduling includes allocating the resource over a timeframe to carry out an assortment of tasks, which is one of the most critical issues in the managing and planning of processes of manufacturing. In a production system, various kinds of scheduling problems are studied and Job Shop Scheduling Problem (JSSP) is one of the most difficult problems in this area. [2].
JSSP is one of the most well-known problems in both fields of production management and combinatorial optimization. In the JSSP, there are n of jobs that must be processed on a given collection of m machines, where each job consists of specified operation order, each operation has a one specified machine to process on, a machine can only process one operation at a time [3].
The classical job shop scheduling problem has been generalized to a flexible Job Shop Scheduling Problem (FJSSP) [4]. In FJSSP, each job operation can process on a set of machines with a processing time which made the problem more difficult to specify a proper machine from a given set that should process each operation [5]. The …show more content…

VND is performed as a strategy for local search of the proposed algorithm. In the AFSA-VND, the visual concept represented as the maximum number of solution’s elements that exchange its location in the solution permutation. The distance between two solutions (Xi and Xj) calculated by hamming distance, which is the number of solution’s elements at which corresponding positions have a different value. The step forward for the AF movement in the discrete space will be taking the same position/solution that evaluated as next better solution for each AF. Algorithm (2) illustrates the proposed algorithm

Open Document