... model is developed based on the process constraints. A Pareto front of possible erection schedules is created using a the Non-dominated Sorting Genetic Algorithm II with a custom heuristic fitness function and constraint violation. Findings – It was possible to consistently generate a wide variety...

...Anish Sachdeva; Vishal Sharma; Arvind Bhardwaj; Rakesh Kumar Phanden; Ajai Jain; Rajiv Verma Purpose The purpose of this paper is to optimise the job shop scheduling problem using simulation and genetic algorithm. Design/methodology/approach The paper presents a simulation‐based genetic...

... a generalized version of the MSG algorithm to solve sharp augmented Lagrangian dual problems. Burachik et al. (2010) proposed an inexact version of the MSG algorithm that may allow solving problems with less computational effort. Genetic algorithms Mathematical modelling Materials handling...

...Anish Sachdeva; Vishal Sharma; Dr Arvind Bhardwaj; Vinay V. Panicker; R. Sridharan; B. Ebenezer Purpose The purpose of this paper is of two‐fold. First, the authors propose the application of genetic algorithm (GA)‐based heuristic for solving a distribution allocation problem for a three‐stage...

...Khairy A.H. Kobbacy; Sunil Vadera; Anna Ławrynowicz Purpose The purpose of this research is to improve efficiency of the traditional scheduling methods and explore a more effective approach to solving the scheduling problem in supply networks with genetic algorithms (GAs). Design/methodology...

... of lost production, the cost of repair persons and the cost of standby machines. The developed design procedure integrates simulation, metamodel and genetic algorithms. Neural networks are able to approximate functions based on a set of sample data, i.e. construct metamodels from simulation results...