This paper presents an algorithm that applies a new mechanism in order to generate scheduling which allows for evaluation of the quality of solutions that are obtained in the Job Shop Scheduling Problem (JSSP). In this research, the quality of the solution is evaluated by using the makespan as an objective function. It is demonstrated experimentally that the proposed algorithm has better efficiency and efficacy when compared to the classic form of scheduling generation used to evaluate the quality of the solution in the JSSP. The efficiency and efficacy obtained by the proposed algorithm make it possible to generate and evaluate a greater number of better quality solutions in less time, so a greater exploration of the solution space for the JSSP can be conducted.
Scheduling Algorithm for the Job Shop Scheduling Problem
2007-09-01
422614 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Flexible job‐shop scheduling problem by genetic algorithm
Online Contents | 2011
|A two-level particle swarm optimisation algorithm for open-shop scheduling problem
British Library Online Contents | 2016
|Two-Layer Harmony Search Algorithm for a Robust Flow Shop Scheduling Problem
Springer Verlag | 2017
|A New Solution Seed for Job Shop Scheduling Problem
British Library Conference Proceedings | 2012
|Computer Assisted Job Shop Scheduling
Kraftfahrwesen | 1980
|