Heuristics for an m-Machine Re-Entrant Permutation Flowshop with the Objective of Total Tardiness

Seong Woo Choi

doi:10.4028/www.scientific.net/AMM.752-753.890

Paper Titles

Technological and Operational Aspects of Integrated Bladed Rotors Manufacture
p.864

Technology for Hydrothermal Destruction of Organic Fuel Materials
p.873

Technological Limitations of Selective Laser Melting Method
p.878

Results of the Study Rotor Wheels Supersonic Microturbines with a Large Angle of Rotation of the Flow
p.884

Heuristics for an m-Machine Re-Entrant Permutation Flowshop with the Objective of Total Tardiness
p.890

Effect of Oil Flow Velocity on Hydraulic Shock
p.896

CFD Analysis for the Turbulent Flow Distribution in a Fuel Assembly with the Split-Type Mixing Vanes by Using the Advanced Scale-Resolving Turbulence Models
p.902

Visualized Flow Structure inside an Odor-Removing Basin System with Multi-Stacked Porous Baffles
p.908

Dynamic Characteristics Research of Magneto-Rheological Fluid Engine Mount
p.913

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 752-753Heuristics for an m-Machine Re-Entrant Permutation...

Heuristics for an m-Machine Re-Entrant Permutation Flowshop with the Objective of Total Tardiness

Abstract:

We focus on an m-machine re-entrant flowshop scheduling problem with the objective of minimizing total tardiness. In the re-entrant flowshop considered here, routes of all jobs are identical as in ordinary flowshops, but the jobs must be processed multiple times on the machines. We present heuristic algorithms, which are modified from well-known existing algorithms for the general m-machine flowshop problem or newly developed in this paper. For evaluation of the performance of the algorithms, computational experiments are performed on randomly generated test problems and results are reported.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 752-753)

Pages:

890-895

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.752-753.890

Citation:

Cite this paper

Online since:

April 2015

Authors:

Seong Woo Choi*

Keywords:

Heuristics, Re-Entrant Flowshop, Total Tardiness

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] J.C.H. Pan, J.S. Chen, Minimizing makespan in re-entrant permutation flow-shops, J. of Operational Res. Soc. 54 (2003) 642-653.

DOI: 10.1057/palgrave.jors.2601556

Google Scholar

[2] J.S. Chen, A branch and bound procedure for the reentrant permutation flow-shop scheduling problem, Int. J. of Adv. Manuf. Technol. 29 (2006) 1186-1193.

DOI: 10.1007/s00170-005-0017-x

Google Scholar

[3] S.W. Choi, Y.D. Kim, Minimizing makespan on a two-machine re-entrant flowshop, J. of the Operational Res. Soc. 58 (2007) 972-981.

DOI: 10.1057/palgrave.jors.2602220

Google Scholar

[4] S.W. Choi, Y.D. Kim, Minimizing makespan on an m-machine re-entrant flowshop, Comput. and Operations Res. 35 (2008) 1684-1696.

DOI: 10.1016/j.cor.2006.09.028

Google Scholar

[5] Y.D. Kim, Heuristics for flowshop scheduling problems minimizing mean tardiness. J. of Operational Res. Soc. 44 (1993) 19-28.

DOI: 10.1057/jors.1993.3

Google Scholar

[6] M. Nawaz, E.E. Enscore, I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop scheduling problem, Omega. 11 (1983) 91-95.

DOI: 10.1016/0305-0483(83)90088-9

Google Scholar