Abstract
The overview presented in this survey paper is quite broad, and its major achievement is to draw together a variety of perspectives on the problem of determining an optimal permutation. By incorporating these perspectives in one review and by including an extensive array of examples, the paper depicts the richness and the scope of the problem. Nevertheless, the paper’s coverage of the topic is uneven, and it avoids evaluating or interpreting the diverse material it has drawn together.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, N. R. “Optimal User Search Sequences and Implications for Information Systems Operation,” American Documentation, Vol. 20, No, 3 (July 1969) pp. 203–212.
Grieshop, D. S.An Analysis of the System Effectiveness of a Sequential Manpower Training Model, M.S. Thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology (January 1972).
Merten, A. G. “Some Quantitative Techniques for File Organizations,” Technical Report No. 15, University of Wisconsin Computing Center (June 1970).
Riesel, H. “In Which Order Are Different Conditions to be Examined?”, BIT, Vol. 3, (1963), 255–256.
Srinivasan, V. “A Hybrid Algorithm for the One Machine Sequencing Problem to Minimize Total Tardiness,” Naval Research Logistics Quarterly, Vol. 18, No. 3, (September 1971), pp. 317–327.
Little, J. D. C., Murty, K. G., Sweeny, D. W., and Karel, C. “An Algorithm for the Traveling-Salesman Problem,” Operations Research Vol. 11, No. 6, (November 1963).
Ignall, E. and Schrage, L. “Application of the Branch-and Bound Technique to Some Flow-Shop Scheduling Problems,” Operations Research, Vol. 13, No. 3, (May 1965).
Pritsker, A., Miller, L. and Zinkl, R. “Sequencing n Products Involving m Independent Jobs on m Machines,” AIIE Transactions, Vol. 3, No. 1, (March 1971).
Shwimer, J. “On the n-Job, One Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution,” Management Science, Vol. 18, No. 6, (February 1972), pp. 301–313.
Elmaghraby, S. E. “The Machine Sequencing Problem--Review and Extensions,” Naval Research Logistics Quarterly, Vol. 15, No. 1, (March 1968).
Conway, R. W., Maxwell, W. L., and Miller, L. W. Theory of Scheduling, Addison-Wesley, Reading, Mass., 1970.
Wiest, J. D. “A Heuristic Model for Scheduling Large Projects with Limited Resources,” Management Science, Vol. 13, No. 6, (February 1967), pp. B359-B377.
Mastor, A. A. “An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques,” Management Science, Vol. 16, No. 11, (July 1970).
Karg, R. L. and Thompson, G. L. “A Heuristic Approach to Solving Traveling Salesman Problems,” Management Science, Vol. 10, No. 2, (January 1964).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Baker, K.R. (1973). Discussion of “Selected Comments Concerning Optimization Theory for Functions of Permutations”. In: Elmaghraby, S.E. (eds) Symposium on the Theory of Scheduling and Its Applications. Lecture Notes in Economics and Mathematical Systems, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80784-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-80784-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06437-4
Online ISBN: 978-3-642-80784-8
eBook Packages: Springer Book Archive