FLOWSHOP SEQUENCING PROBLEMS WITH LIMITED BUFFER STORAGE

被引：131

作者：

LEISTEN, R

机构：

[1] Alfred Weber-Institute, University of Heidelberg, 6900, Heidelberg

来源：

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | 1990年 / 28卷 / 11期

关键词：

D O I：

10.1080/00207549008942855

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

Sequencing problems and especially flowshop sequencing problems have been broadly discussed in literature. But usually the effect of limited buffer storage is ignored, although in industrial production or computer architecture the amount of available buffer storage has an important influence on the performance of the system. This paper presents a systematic overview of how to formulate flowshop problems with limited buffer storage as well as several heuristics to compete with this class of problems. Numerical experiences are also described. © 1990 Taylor & Francis Group, LLC.

引用

页码：2085 / 2100

页数：16

共 22 条

[11]

Lenstra J.K., Rinnooy Kan A., New directions in scheduling theory, Operations Research Letters, 2, pp. 255-259, (1984)

[12]

Liesegang G., Schirmer A., Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung, Zeitschrift für Operations Research, 19, pp. 195-211, (1975)

[13]

Nawaz M., Enscore E.E., Ham I., A heuristic algorithm for the m-rnachine. N-job flow-shop sequencing problem, Omega, 11, pp. 91-95, (1983)

[14]

Palmer D.S., Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum, Operational Research Quarterly, 16, pp. 101-107, (1965)

[15]

Papadimitriou C.H., Kanellakis P.C., Flowshop scheduling with limited temporary storage, Journal of the Association for Computing Machinery, 27, pp. 533-554, (1980)

[16]

Park Y.B., Pegden C.D., Enscore E.E., A survey and evaluation of static flowshop scheduling heuristics, International Journal of Production Research, 22, pp. 127-141, (1984)

[17]

Piehler J., Ein Beitrag zum Reihenfolgeproblem, Unternehmensforschung, 4, pp. 138-142, (1960)

[18]

Potts C.N., An adaptive branching rule for the permutation flow-shop problem, European Journal of Operational Research, 5, pp. 19-25, (1980)

[19]

Reddi S.S., Sequencing with finite intermediate storage, Management Science, 23, pp. 216-217, (1976)

[20]

Reddi S.S., Ramamoorthy C.Y., On the flow-shop sequencing problem with no wait in process, Operational Research Quarterly, 23, pp. 323-331, (1972)

← 1 2 3 →