Research on a Main-Branch Hybrid Flow Shop Scheduling Problem in Production Manufacturing System

Xin Min Zhang; Meng Yue Zhang

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

Paper Titles

Numerical Simulation for Gas Supply Line Design in Manufacturing Process of Silicon Solar Cells Based on Steady State Fluid Dynamics
p.331

The Mechanical Drawing Distributed Synchronous Audit System Design for Product Development Process Based on Web
p.339

Material Scheduling with Storage Windows Based on Modified Particle Swarm Algorithm for Material Manufacturing System
p.343

Study on Master Production Schedule in Manufacturing System for Medium and Small Manufacture Enterprises
p.349

Research on a Main-Branch Hybrid Flow Shop Scheduling Problem in Production Manufacturing System
p.354

Microstructure Morphology Evolution of Single Crystal Copper Rod by Ohno Continuous Casting in Copper Manufacturing System
p.360

Analysis on the Establishment of Sustainable Developmental Competition-Index-System in Industrial Manufacturing System in Hebei
p.364

Analysis of China's Iron and Steel Industry Development of Circular Manufacturing for Environment
p.368

Research on Relevance Modeling Method for Equipment Testability in Manufaturing Process
p.372

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 252Research on a Main-Branch Hybrid Flow Shop...

Research on a Main-Branch Hybrid Flow Shop Scheduling Problem in Production Manufacturing System

Abstract:

A main-branch hybrid Flow shop scheduling problem in production manufacturing system is studied. Under the premise of JIT, targeting of smallest cost, a Flow-Shop production line scheduling model is built in cycle time of buffer. Two stages Quantum Genetic Algorithm (QGA) is proposed. By the results of numerical example, the effective and advantageous of QGA was shown.

You might also be interested in these eBooks

Advanced Research on Applied Mechanics and Manufacturing System

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 252)

Pages:

354-359

DOI:

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

Citation:

Cite this paper

Online since:

December 2012

Authors:

Xin Min Zhang, Meng Yue Zhang

Keywords:

JIT, Main-Branch Line, Material Scheduling, Mixed Production

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Cao Zhijun. Analysis on rolling planning and scheduling algorithm and study on complex product flow scheduling problem. Shanghai Jiaotong University, 2004.

Google Scholar

[2] Sundararaghavan P, Kunnathur A, Viswanathan I.Minimizing make span in parallel flow shop. Opns Res Soc, 1997(48): 834-842.

DOI: 10.1038/sj.jors.2600408

Google Scholar

[3] WEI Wengao, JIANG Zhenzhen, YU Xiang. Research and simulation on flow-shop scheduling problem based on improved genetic algorithm. Equip Manufacturing Technology. 2011(2):10-12.

Google Scholar

[4] S. Crawford, VC. S. Wiers. From anecdotes to theory: a review of existing knowledge on human factors of Planning and scheduling. Eds. London. 2001.26(9):15-43

Google Scholar

[5] YANRADEEP. Application of optimized production technology in a capacity constrained flow shop: a Case study in automotive factory. Computers Industrial Engineering. 2003.27(2):217-220

DOI: 10.1016/0360-8352(94)90274-7

Google Scholar

[6] Jung Soonchul, Moon Byung-Ro. Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP. IEEE Transactions on Evolutionary Computation, 2002, 6(6); 557-565

DOI: 10.1109/tevc.2002.804321

Google Scholar

[7] Fatih Tasgetiren M, Pan Quan-Ke, Suganthan P N, et al. A discrete differential evolution algorithm for the no-wait flowshop scheduling problem with total flow time criterion. Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling. New York, USA: ACM, 2007: 251-258.

DOI: 10.1109/scis.2007.367698

Google Scholar

[8] Rajendran C, Ziegler H. Ant colony algorithms for permutation flowshop scheduling to minimize make span/total flow time of job. European Journal of Operational Research,2004, 155: 426-438.

DOI: 10.1016/s0377-2217(02)00908-6

Google Scholar