Selected Comments Concerning Optimization Techniques for Functions of Permutations

  • John G. Rau
Conference paper
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 86)


In this paper is provided a brief overview of the status of techniques in optimizing functions of permutations both with and without constraints. Problems of this type are readily found in the literature on sequencing and scheduling as well as in sequential search and testing. The kinds of techniques that are applicable range from dynamic programming to random search and simple pairwise switching of coordinates. In general, necessary and sufficient conditions for local optima do not exist, however the known conditions for special cases are presented.


Neighborhood Structure Precedence Constraint Precedence Relationship Equivalent Element Contiguity Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Bellman, R.E., Dynamic Programming, Princeton University Press, Princeton, N.J., 1957Google Scholar
  2. [2]
    Boothroyd, H., “Least-Cost Testing Sequence”, Oper. Res. Quart., Vol. 11 No. 3, Sept. 1960Google Scholar
  3. [3]
    Bowdon, E.K., “Priority Scheduling in a Network of Computers”, IEEE Trans, on Comp., Vol. C-18 No. 11, Nov. 1969, pp. 1021–1026CrossRefGoogle Scholar
  4. [4]
    Conway, R.W., W.L. Maxwell and L.W. Miller, Theory of Scheduling, Addison-Wesley, Reading, Mass., 1967Google Scholar
  5. [5]
    Dean, B.V., “Low Cost-High Risk Sequencing of Research Tasks”, Opsearch, Vol. 5 No. 3, Sept. 1968Google Scholar
  6. [6]
    Demski, J.S., “Optimizing the Search for Cost Deviation Sources”, Man. Sci., Vol. 16 No. 8, April 1970, pp. 486–494Google Scholar
  7. [7]
    Denby, D.C., “Minimum Downtime as a Function of Reliability and Priority Assignments in a Component Repair”, Jour, of Ind. Eng., Vol. 18 No. 7, July 1967, pp. 436–439Google Scholar
  8. [8]
    Elmaghraby, S.E., “The Sequencing of “Related” Jobs”, Nav. Res. Log. Quart., Vol. 15 No. 1, March 1968, pp.23–32Google Scholar
  9. [9]
    Elmaghraby, S.E., “The Machine Sequencing Problem — Review and Extensions”, Nav. Res. Log. Quart., Vol. 15 No. 2, June 1968, pp. 205–232Google Scholar
  10. [10]
    Elmaghraby, S.E., “A Graph Theoretic Interpretation of the Sufficiency Conditions for the Contiguous-Binary-Switching (CBS)-Rule”, Oper. Res. Report No. 68, Nov. 3, 1970, North Carolina State UniversityGoogle Scholar
  11. [11]
    Emmons, H., “One-Machine Sequencing to Minimize Certain Functions of Job Tardiness”, Oper. Res., Vol. 17 No. 4, July-Aug. 1969, pp. 701–715CrossRefGoogle Scholar
  12. [12]
    Everett, H., “Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources”, Oper. Res., Vol. 2, 1963, pp. 399–417CrossRefGoogle Scholar
  13. [13]
    Firstman, S.I. and B. Gluss, “Optimum Search Routines for Automatic Fault Location”, Oper. Res., Vol. 8 No. 4, July-Aug. 1960, pp. 512–523CrossRefGoogle Scholar
  14. [14]
    Flood, M.M., “The Traveling — Salesman Problem”, Oper. Res., Vol. 4, 1956, pp. 61–75CrossRefGoogle Scholar
  15. [15]
    Gapp, W., P.S. Mankekar and L.G. Mitten, “Sequencing Operations to Minimize In-Process Inventory Costs”, Man. Sci., Vol. 11 No. 3, Jan. 1965, pp. 476–484Google Scholar
  16. [16]
    Held, M. and R.M. Karp, “A Dynamic Programming Approach to Sequencing Problems”, J. Soc. Indust. Appl. Math., Vol. 10 No. 1, March 1962, pp. 196–210CrossRefGoogle Scholar
  17. [17]
    Johnson, S.M., “Optimal Two-and Three-Stage Production Schedules with Setup Times Included”, Nav. Res. Log. Quart., Vol. 1 No. 1, March 1954, pp. 61–68CrossRefGoogle Scholar
  18. [18]
    Mankekar, P.S. and L.G. Mitten, “The Constrained Least Cost Testing Sequence Problem”, Jour. of Ind. Eng., Vol. 16 No. 2, Mar.-Apr. 1965, pp. 146–149Google Scholar
  19. [19]
    Mitten, L.G., “An Analytic Solution to the Least Cost Testing Sequence Problem”, Jour, of Ind. Eng., Vol. 11 No. 1, Jan.-Feb. 1960Google Scholar
  20. [20]
    Rau, J.G,, “Minimizing a Function of Permutations of n Integers” Oper. Res., Vol. 19 No. 2, Mar.-Apr. 1971, pp. 237–240CrossRefGoogle Scholar
  21. [21]
    Reiter, S. and G. Sherman, “Discrete Optimizing”, J. Soc. Indust. Appl. Math., Vol. 13 No. 3, Sept. 1965, pp. 864–889CrossRefGoogle Scholar
  22. [22]
    Reynolds, G.H., “A Shuttle Car Assignment Problem in the Mining Industry”, Man. Sci., Vol. 17 No. 9, May 1971, pp. 652–655Google Scholar
  23. [23]
    Smith, W.E., “Various Optimizers for Single-Stage Production”, Nav. Res. Log. Quart., Vol. 3, 1956, pp. 59–66CrossRefGoogle Scholar
  24. [24]
    Wagner, H.M., Principles of Operations Research, Prentice-Hall, Englewood Cliffs, N.J. 1969Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1973

Authors and Affiliations

  • John G. Rau
    • 1
  1. 1.ULTRASYSTEMS, Inc.Newport BeachUSA

Personalised recommendations