Data Processing with a Genetic Algorithm for Flow Line Processing Scheduling Problem

Fang Guo He

doi:10.4028/www.scientific.net/AMM.685.630

Paper Titles

Applied-Information Technology for Paging Frame Page in Scientific Research Management System
p.609

Technology of Data Conversion and Reconstruction for Complex Surface Based on Non-Contact Measurement
p.614

MC Simulation of SEBLUP with Spatial Linear Mixed Model for SAE
p.618

Syntax Analysis: The Left-Most-Derivation-and-Reduction Trees and its Compare with the LR Parsing Methods
p.623

Data Processing with a Genetic Algorithm for Flow Line Processing Scheduling Problem
p.630

Data Processing in Bifurcation Analysis of Maps with Time-Delays in the Frequency Domain
p.634

Wavelet-Based Immune Fuzzy C-Means Algorithm
p.638

Application of Genetic Algorithm to Image Segmentation
p.642

Non-Probabilistic Reliability Computation and Efficiency Assessment Based on Interval Model
p.646

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 685Data Processing with a Genetic Algorithm for Flow...

Data Processing with a Genetic Algorithm for Flow Line Processing Scheduling Problem

Abstract:

The scheduling optimization of the flow line is a core of modern managing technology and Data Processing. The goal of the problem is to minimize the sum of the total flow time. Aiming at machine scheduling of production process, this paper presents a genetic algorithm based heuristic for the problem. An encoding method based working procedure and parthenogenetic operations are applied to solve the flow line scheduling problem. The computational results indicate that the proposed approach is effective in terms of reduced makespan for the attempted problems.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 685)

Pages:

630-633

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.685.630

Citation:

Cite this paper

Online since:

October 2014

Authors:

Fang Guo He

Keywords:

Data Processing, Genetic Algorithm (GA), Scheduling Problem

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Rubén Ruiz. The hybrid flow shop scheduling problem. Oper. Res. 205 (2010), pp.1-18.

Google Scholar

[2] Masao Yokoyama. Flow-shop scheduling with setup and assembly operations. European Journal of Operational Research, Vol. 187 (2008), pp.1184-1195.

DOI: 10.1016/j.ejor.2006.06.067

Google Scholar

[3] S. M. Johnson, Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1954), p.61–68.

DOI: 10.1002/nav.3800010110

Google Scholar

[4] M. Pinedo, Scheduling, Theory, Algorithms and Systems, Prentice-Hall, NJ, (1995).

Google Scholar

[5] B.L. MacCarthy, J. Liu, Addressing the gap in scheduling research; a review of optimization and heuristic methods in production scheduling, Int. J. Prod. Res. 31 (1993), pp.59-79.

DOI: 10.1080/00207549308956713

Google Scholar

[6] D.A. Wiser, Solution of the flowshop problem with no intermediate queues, Oper. Res. 20 (1972), pp.689-97.

Google Scholar

[7] C. Rajendran, Heuristic algorithms for continuous flowshop problem, Naval Res. Logistic 37(1990), pp.695-705.

Google Scholar