Approach for Flow Shop Scheduling Based on Petri Net

Bing Yi Yan; Pei Jun Li

doi:10.4028/www.scientific.net/AMR.542-543.367

Paper Titles

Optimization Retrieval for Manufacturing Resources Based on Interval Number
p.349

Application of HAZOP Method in the Design of Shallow Water Catheter Frame Platform
p.353

Two-Stage Supply Chain Inventory Coordination Strategy with Supply-Hub Operation Mode
p.358

Manufacturer Technology of Dense Chinese Fir Laminated Veneer Lumber (LVL)
p.363

Approach for Flow Shop Scheduling Based on Petri Net
p.367

Innovating the Mode of Engineer Training and Promoting the Training Program of Excellent Engineers
p.371

A Cutter Production Management System Based on the Hybrid Architecture of C/S and B/S
p.377

The Research of Automation Management Based on Configuration Technology
p.381

VaR-Based Job Shop Scheduling Model and Algorithm
p.386

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 542-543Approach for Flow Shop Scheduling Based on Petri...

Approach for Flow Shop Scheduling Based on Petri Net

Abstract:

A flow shop scheduling problem based on the controlled Petri net and GASA is presented with multi-workstation operation. Firstly, the math model of this flow shop scheduling problem is constructed. Secondly, Petri net controller is designed based on Parikh vector, and the Petri net model is constructed. And then, GASA is applied based on the math model and the controlled Petri net model. Finally, one example is applied to test the effectiveness of the method.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 542-543)

Pages:

367-370

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.542-543.367

Citation:

Cite this paper

Online since:

June 2012

Authors:

Bing Yi Yan, Pei Jun Li

Keywords:

Flow Shop Scheduling, Genetic Algorithm and Simulated Annealing Algorithm (GASA), Multi-Workstation, Petri Net

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] M.R. Garey, D.S. Johnson. a Guide to the Theory of NP-Completeness. Computers and Intractability, Freeman, SanFrancisco, 1979.

Google Scholar

[2] Li B B, Wang L. A hybrid quantum-inspired genetic algorithm for multiobjective flow shop scheduling. IEEE Transactions on Systems, Man, and Cybernetics—Part B: Cybernetics (S0018-9472), 2007, 37(3): 576-591.

DOI: 10.1109/tsmcb.2006.887946

Google Scholar

[3] Li X P, Wang Q, Wu Cheng. An efficient method for no-wait flow shop scheduling to minimize makespan. Proceedings of the 10th International Conference on Computer Supported Cooperative Work in Design(S978-3-540-72862-7),Nanjing, China, 2006, 1-6.

DOI: 10.1109/cscwd.2006.253027

Google Scholar

[4] Chen J H, Fu L C, Lin M H. Petri-net and GA-based approach to modeling, scheduling, and performance evaluation for wafer fabrication. IEEE Transaction on Robotics and Automation, 2001,17(5): 619-636.

DOI: 10.1109/70.964663

Google Scholar

[5] Hao D, Jiang C J, and Lin L. Petri Net Based Modeling and GA Based Scheduling for FMS. Chinese Journal of Computers, 2005, 28 (2): 201-208.

Google Scholar

[6] Jiang S J, Li Z H. Petri nets based dynamic optimal model for flexible manufacturing system. Computer Integrated Manufacturing Systems, 2005, 11 (4): 462-466.

Google Scholar

[7] Byung J, Hyung R, Hyun S. A hybrid genetic algorithm for the job shop scheduling problems, Computers & Industrial Engineering, 2003,45: 597-613.

DOI: 10.1016/s0360-8352(03)00077-9

Google Scholar