Managing Genetic Search in Job Shop Scheduling

Authors:
Serdar Uckun;Sugato Bagchi;Kazuhiko Kawamura;Yutaka Miyabe
Affiliations:
-;-;-;-
Venue:
IEEE Expert: Intelligent Systems and Their Applications
Year:
1993

Citing 4
Cited 5

Construction and maintaining detailed production plans: Investigations into the development of knowledge-based factory scheduling systems

AI Magazine
Job Shop Scheduling with Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
Using Genetic Algorithms to Schedule Flow Shop Releases

Proceedings of the 3rd International Conference on Genetic Algorithms

Applying Fuzzy Logic to Codesign Partitioning

IEEE Micro
Parto-Optimal Solutions for Multi-objective Production Scheduling Problems

EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
A hybrid genetic algorithm for the job shop scheduling problems

Computers and Industrial Engineering
GA-based decision support systems in production scheduling

International Journal of Intelligent Systems Technologies and Applications
Machine scheduling in custom furniture industry through neuro-evolutionary hybridization

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Vanderbilt Schedule Optimizer Prototype (VSOP), which uses genetic algorithms as search methods for job shop scheduling problems, is discussed. A job shop is a facility that produces goods according to prespecified process plans, under several domain-dependent and common sense constraints. The scheduling of orders in a job shop is a multifaceted problem. VSOP uses domain-specific chromosome representations, recombination operators, and local enumerative search to increase efficiency. Experimental results from a fully implemented VSOP package are presented.