A hybrid neural network- meta heuristics approach for permutation flow shop scheduling problems
23 Dec 2010-pp 286-290
TL;DR: The objective of this study is to find a sequence of jobs for the permutation flow shop to minimize makespan and the sequence obtained using neural network is used to generate initial population for genetic algorithm (ANN-GA), genetic algorithm using Random Insertion Perturbation Scheme and Simulated Annealing.
Abstract: The objective of this study is to find a sequence of jobs for the permutation flow shop to minimize makespan. A feed forward back propagation neural network is used to solve the 10 machine problem taken from the literature. The network is trained with the optimal sequences for five, six and seven jobs problem. This trained network is then used to solve the problem with greater number of jobs. The sequence obtained using neural network is used to generate initial population for genetic algorithm (ANN-GA), genetic algorithm using Random Insertion Perturbation Scheme (ANN-GA-RIPS) and Simulated Annealing (ANN-SA). Makespans obtained through these approaches are compared with the Taillard's benchmark problems.
Citations
More filters
TL;DR: In this article, a fully verifiable and deployable framework for optimizing schedules in a batch-based production system is proposed, which is designed to control and optimize the flow of batches of material into a network of identical and non-identical parallel and series machines that produce a high variation of complex hard metal products.
Abstract: A fully verifiable and deployable framework for optimizing schedules in a batch-based production system is proposed. The scheduler is designed to control and optimize the flow of batches of material into a network of identical and non-identical parallel and series machines that produce a high variation of complex hard metal products. The proposed multi-objective batch-based flowshop scheduling optimization (MOBS-NET) deploys a fully connected deep neural network (FCDNN) with respect to three performance criteria of energy, cost and makespan. The problem is NP-hard and considers minimizing the energy consumed per unit of product, operations cost, and the makespan. The output of the method has been validated and verified as optimal operational planning and scheduling meeting the business operational objectives. Real-time and look ahead discrete event simulation of the production process provides the feedback and assurance of the robustness and practicality of the optimum schedules prior to implementation.
2 citations
References
More filters
TL;DR: The quality of the measure of performance is better when ANN approach is used than obtained by constructive or improvement heuristics, and the system’s efficiency increases with increasing numbers of training exemplars.
Abstract: This paper considers the sequencing of jobs that arrive in a flow shop in different combinations over time. Artificial neural network (ANN) uses its acquired sequencing knowledge in making the future sequencing decisions. The paper focuses on scheduling for a flow shop with ‘m’ machines and ‘n’ jobs. The authors have used the heuristics proposed by Campbell et al.(1970, A heuristic algorithm for n-jobs m-machines sequencing problem) to find a sequence and makespan (MS). Then a pair wise interchange of jobs is made to find the optimal MS and total flow time (TFT). The obtained sequence is used for giving training to the neural network and a matrix called neural network master matrix (NNMM) is constructed, which is the basic knowledge of the neurons obtained after training. From the matrix, interpretations are made to determine the optimum sequence for the jobs that arrive in the future over a period of time. The results obtained by the ANN are compared with a constructive heuristics and an improvement heuristics. The results show that the quality of the measure of performance is better when ANN approach is used than obtained by constructive or improvement heuristics. It is found that the system’s efficiency (i.e., obtaining the optimal MS and TFT) increases with increasing numbers of training exemplars.
18 citations
13 Oct 2005
TL;DR: Experimental results show that improved genetic algorithm is quite flexible with satisfactory results, and require fewer running time than pure genetic algorithms and simulated annealing.
Abstract: Flow shop sequencing is one of the most well-known production scheduling problems and a typical NP-hard combinatorial optimization problem with strong engineering background. To efficiently deal with flow shop sequencing problems, an improved genetic algorithm using novel adaptive genetic operators is proposed. Researches are made in aspects such as problem modeling, encoding, decoding, crossover and mutation of genetic algorithms and so on. The proposed algorithm has been tested on scheduling problem benchmarks. Experimental results show that improved genetic algorithm is quite flexible with satisfactory results, and require fewer running time than pure genetic algorithms and simulated annealing
5 citations