×

Flowshop sequencing problems with limited buffer storage. (English) Zbl 0707.90054

Summary: 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.

MSC:

90B35 Deterministic scheduling theory in operations research
90-08 Computational methods for problems pertaining to operations research and mathematical programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] CAMPBELL H. G., Management Science 16 pp pB630–B637– (1970) · Zbl 0194.50504 · doi:10.1287/mnsc.16.10.B630
[2] DANNENBRING D. G., Management Science 23 pp 1174– (1977) · Zbl 0371.90063 · doi:10.1287/mnsc.23.11.1174
[3] DUFTA S. K., Management Science 21 pp 989– (1975) · Zbl 0306.90034 · doi:10.1287/mnsc.21.9.989
[4] GAREY M. R., Mathematics of Operations Research 1 pp 117– (1976) · Zbl 0396.90041 · doi:10.1287/moor.1.2.117
[5] GILMORE R. C., Operations Research 12 pp 655– (1964) · Zbl 0126.36006 · doi:10.1287/opre.12.5.655
[6] JOHNSON S. M., Naval Research Logistics Quarterly 1 pp 61– (1954) · Zbl 1349.90359 · doi:10.1002/nav.3800010110
[7] KING J. R., International Journal of Production Research 18 pp 345– (1980) · doi:10.1080/00207548008919673
[8] LAWLER E. L., Mathematical Programming. The State of the Art, Bonn 1982 pp 202– (1983)
[9] LAWLER E. L., Deterministic and Stochastic Scheduling Proceedings of the NATO Advanced Study and Research Institute on Theoretical Approaches to Scheduling Problems (1982)
[10] LEISTEN R. L., Die Einbeziehung beschrankter Zwischenlager in die Auflragsreihen- folgeplanung bei Reihenfertigung (1985)
[11] LENSTRA J. K., Operations Research Letters 2 pp 255– (1984) · Zbl 0528.90047 · doi:10.1016/0167-6377(84)90074-9
[12] LIESEGANG G., Zeitschrift fur Operations Research 19 pp 195– (1975)
[13] NAWAZ M., Omega 11 pp 91– (1983) · doi:10.1016/0305-0483(83)90088-9
[14] PALMER D. S., Operational Research Quarterly 16 pp 101– (1965) · doi:10.1057/jors.1965.8
[15] PAPADIMITRIOU C. H., Journal of the Association for Computing Machinery 27 pp 533– (1980) · Zbl 0475.68014 · doi:10.1145/322203.322213
[16] PARK Y. B., International Journal of Production Research 22 pp 127– (1984) · Zbl 0541.90055 · doi:10.1080/00207548408942436
[17] PIEHLER J., Unternehmensforschung 4 pp 138– (1960)
[18] POTTS C. N., European Journal of Operational Research 5 pp 19– (1980) · Zbl 0436.90063 · doi:10.1016/0377-2217(80)90069-7
[19] REDDI S. S., Management Science 23 pp 216– (1976) · Zbl 0342.90028 · doi:10.1287/mnsc.23.2.216
[20] REDDI S. S., Operational Research Quarterly 23 pp 323– (1972) · Zbl 0238.90080 · doi:10.1057/jors.1972.52
[21] RINNOOY KAN A. H. G., Machine Scheduling Problems, Classification, Complexity and Computations (1976)
[22] ROCK H., Flowshop Scheduling with No Wait in Process on Three Machines (1982)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.