The Research of Heuristic Algorithm for Flow Shop Scheduling Problem

Dan Tang; Hong Ping Shu

doi:10.4028/www.scientific.net/AMR.605-607.528

Paper Titles

Value Chain Theory and its Application in Steel Enterprises
p.507

Business Process Management for Information System Implementation in Discrete Manufacturing Workshops Based on Multi-Agent Simulation
p.511

Research on Confidence Degree of Enterprise Alliance under the Environment of Network-Based Manufacturing
p.516

Scheduling to a Common Due Date on Unrelated Parallel-Machine with Deteriorating Jobs
p.521

The Research of Heuristic Algorithm for Flow Shop Scheduling Problem
p.528

Research on the Application of Operation Characteristic Curve in the Sampling Inspection for Foods in Prepackages with Fixed Content
p.532

Study on Coal Lean Mining Theory and Practice
p.538

A Multi-Issue Negotiation Based Task Allocation in Virtual Enterprise
p.542

Introduction of IOT Technology in a Logistic System for High-End Wine Sales
p.549

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 605-607The Research of Heuristic Algorithm for Flow Shop...

The Research of Heuristic Algorithm for Flow Shop Scheduling Problem

Abstract:

For the flow shop scheduling problem which aims to minimize makespan, this paper gives a new derivation about its mathematical definition, and mining characteristics of the problem itself further. By which analysis, the new heuristic method proposed in the paper shorten the waiting time of each job as much as possible on the basis of reduce the processing time of the first machine and last job. The result of simulation experiments shows that, our new heuristic algorithm has good performance, and the average quality and stability of scheduling sequences generated by new method is significantly better than other heuristic algorithm which has the same complexity.

You might also be interested in these eBooks

Advanced Designs and Researches for Manufacturing

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 605-607)

Pages:

528-531

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.605-607.528

Citation:

Cite this paper

Online since:

December 2012

Authors:

Dan Tang, Hong Ping Shu

Keywords:

Flow Shop, Heuristic Algorithm , Production Scheduling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Garey, M. R., Johnson, D.S., Sethi, Ravi. The Complexity of Flowshop and Jobshop Scheduling. Mathematics of Operations Research, May76, Vol. 1 Issue 2, pp.117-129.

DOI: 10.1287/moor.1.2.117

Google Scholar

[2] Baker K R. Introduction to sequencing and scheduling[M] . New York: Wiley, (1974).

Google Scholar

[3] Ling Wang , Liang Zhang , Da-Zhong Zheng, An effective hybrid genetic algorithm for flow shop scheduling with limited buffers, Computers and Operations Research, v. 33 n. 10, pp.2960-2971, October (2006).

DOI: 10.1016/j.cor.2005.02.028

Google Scholar

[4] I-Hong Kuo , Shi-Jinn Horng , Tzong-Wann Kao , Tsung-Lieh Lin , Cheng-Ling Lee , Takao Terano , Yi Pan, An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model, Expert Systems with Applications: An International Journal, v. 36 n. 3, pp.7027-7032, April, (2009).

DOI: 10.1016/j.eswa.2008.08.054

Google Scholar

[5] Guenther Fuellerer, Karl F. Doerner, Richard F. Hartl, Manuel Iori. Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers & Operations Research, Vol. 36, No. 3. (March 2009), pp.655-673.

DOI: 10.1016/j.cor.2007.10.021

Google Scholar

[6] Palmer D S. Sequencing Jobs through a Multi-Stage Process in the Minimum Total Time— a Quick Method of Obtaining a near Optimum [J]. Operational Research Quarterly, 1965, 16: 101-107.

DOI: 10.1057/jors.1965.8

Google Scholar

[7] Gupta J. A Functional Heuristic Algorithm for the Flowshop Scheduling Problem [J]. Operational Research Quarterly, 1971, 22: 39-47.

DOI: 10.2307/3008015

Google Scholar

[8] Campbell H G, Dudek R A, Smith M L. A Heuristic Algorithm for the n-Job, m-Machine Scheduling Problem. [J]. Management Science, 1970, 16: 630–637.

DOI: 10.1287/mnsc.16.10.b630

Google Scholar