Using genetic algorithms to solve the multi-product JIT sequencing problem with set-ups
- 1 August 2000
- journal article
- research article
- Published by Informa UK Limited in International Journal of Production Research
- Vol. 38 (12), 2653-2670
- https://doi.org/10.1080/002075400411411
Abstract
This paper presents a methodology to solve the Just-in-Time (JIT) sequencing problem for multiple product scenarios when set-ups between products are required. Problems of this type are combinatorial, and complete enumeration of all possible solutions is computationally prohibitive. Therefore, Genetic Algorithms are often employed to find desirable, although not necessarily optimal, solutions. This research, through experimentation, shows that Genetic Algorithms provide formidable solutions to the multi-product JIT sequencing problem with set-ups. The results also compare favourably to those found using the search techniques of Tabu Search and Simulated Annealing.This publication has 3 references indexed in Scilit:
- Proceedings of the First International Conference on Genetic Algorithms and their ApplicationsPublished by Informa UK Limited ,2014
- JIT sequencing for mixed-model assembly lines with setups using Tabu SearchProduction Planning & Control, 1998
- Evaluating mixed-model assembly line sequencing heuristics for just-in-time production systemsJournal of Operations Management, 1990