The Scheduling of a Multi-Product Facility

  • Salah E. Elmaghraby
  • Arup Mallik
Conference paper
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 86)

Abstract

We are concerned with obtaining the optimal schedule of N products over a single facility in the finite and infinite horizons. This is a generalization of the classical cyclical “Economic Manufacturing Quantity” formulations. Through number-theoretic arguments we discuss questions of feasibility, the existence of communicating classes, and sensitivity to “saturation”. In the finite horizon case, we present an algorithm that generates the production plan, and another algorithm that generates the production schedule through a shortest-path interpretation. In the infinite horizon case, we do likewise: the optimal production plan is a Turnpike cycle. Due to the immensity of the state space, approximate procedures are also discussed.

Keywords

Planning Horizon Production Plan Optimal Schedule Feasible Schedule Infinite Horizon 
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.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Blackwell, D., “Discrete Dynamic Programming”, Ann Math. Stat., 33, (1962), 719–726.CrossRefGoogle Scholar
  2. 2.
    Bomberger, E. E., “A Dynamic Programming Approach to a Lot Size Scheduling Problem”, Mgt. Sc., Vol. 12, No. 11, July 1966.Google Scholar
  3. 3.
    Brown, Robert G., Management Decisions for Production Operations, Dryden Press, Inc., Hinsdale, Ill. (1971).Google Scholar
  4. 4.
    Dantzig, G. B., W. O. Blattner, and M. R. Rao., “Finding a Cycle in a Graph with Minimum Cost to Time Ratio with Application to a Ship Routing Problem”, Operations Research House, Stanford Univ., Technical Report No. 66–1.Google Scholar
  5. 5.
    de Ghellink, G. T., “Les Problemes de Decisions Sequentielles”, Cahiers Centre d’Etudes Rech. Operationnelle, 2, (1960), 161–179.Google Scholar
  6. 6.
    Derman, G., “On Sequential Decisions and Markov Chains”, Mgt. Sc., 9, 1 (Oct. 1962), 16–24.CrossRefGoogle Scholar
  7. 7.
    Doll, C. Loren, “An Integer-Constrained EOQ-Based Single Machine Scheduling Heuristic”, Paper No. 337, Oct. 1971, The Inst, for Res. in the Behavioral, Economic and Mgt. Sciences, Purdue Univ., Lafayette, Ind.Google Scholar
  8. 8.
    Dooley, J. E. and Ben Bernholtz, “A Many Product Single-Machine Recursive Scheduling Procedure”, Can. Oper. Res. Soc. Jour., 7, 3, (1969), 165–176.Google Scholar
  9. 9.
    Eilon, S., “Economic Batch Size Determination of Multi-Product Scheduling”, Operational Research Quarterly, (England), Vol. 9, No. 4, Dec. 1958.Google Scholar
  10. 10.
    Elmaghraby, S. E., “The Machine Sequencing Problem: Review and Extensions”, Nav. Res. Log. Quart., Vol. 15, No. 2, June 1968.Google Scholar
  11. 11.
    Elmaghraby, S. E. and A. Mallik, “The Scheduling of a Multi-Product Facility”, O.R. Report No. 76, N. C.State Univ., April 10, 1972.Google Scholar
  12. 12.
    Elmaghraby, S. E., A. Mallik and H.L.W. Nuttle, “The Sequencing of Lots on a Single Facility”, Ind. Eng. Transactions, Vol. 2, No. 3, Sept., 1970.Google Scholar
  13. 13.
    Elmaghraby, S. E., “A Graph Theoretic Interpretation of the Sufficiency Conditions for the Contiguous-Binary-Switching (CBS) Rule, Nav. Res. Log. Quart., 18, 3, 339–364 (Sept. 1971).CrossRefGoogle Scholar
  14. 14.
    Glassey, C. R., “An Algorithm for a Machine Loading Problem”, Jour, of I.E., Oct. 1967, Vol. XVIII, No. 10.Google Scholar
  15. 15.
    Haessler, R. W., “A Note on Scheduling a Multi-Product Single Machine System for an Infinite Planning Period”, Letter to Ed., Mgt. Sc, 18, 4, (Dec. 1971), B240–B241).Google Scholar
  16. 16.
    Hanssmann, Fred, “Operations Research in Production and Inventory”, John Wiley, 1962, pp. 158–160.Google Scholar
  17. 17.
    Harris, Ford, Operations and Cost (Factory Management Services), A. W. Shaw Co., Chicago, (1915), pp. 48–52.Google Scholar
  18. 18.
    Krone, L. W., “A Note on Economic Lot Sizes for Multi-Purpose Equipment”, Mgt. Sc., 10, 3, 461–464 (Apr. 1964).CrossRefGoogle Scholar
  19. 19.
    Madigan, J. G., “Scheduling a Multi-Product Single Machine System for an Infinite Planning Period”, Mgt. Sc., 14, 11, (July 1968), 713–719.CrossRefGoogle Scholar
  20. 20.
    Mallik, A., “The Scheduling of a Single Processor Under Deterministic Demand for Several Products”, Unpublished Ph.D. Dissertation, N. C. State Univ., Raleigh, N. C., August, 1972.Google Scholar
  21. 21.
    Manne, A. S., “Linear Programming and Sequential Decisions”, Mgt. Sc., 6, 3 (Apr. 1960), 259–267.CrossRefGoogle Scholar
  22. 22.
    Maxwell, William L., “The Scheduling of Economic Lot Sizes”, Nav. Res. Log. Quart., Vol. 11, Nos. 2 & 3, June-Sept. 1964.Google Scholar
  23. 23.
    Raymond, F. E., Quantity and Economy in Manufacture, McGraw-Hill, 1931.Google Scholar
  24. 24.
    Rogers, J., “A Computational Approach to the Lot Scheduling Problem”, Mgt. Sc., Vol. 4, No. 3, April, 1958.Google Scholar
  25. 25.
    Salveson, M. E., “Mathematical Theory of Production”, Jour, of Ind. Eng., Vol. 4, No. 1, Feb. 1953.Google Scholar
  26. 26.
    Shapiro, J. F., “Shortest Route Methods for Finite State Space Deterministic C.P. Problems”, SIAM,Vol. 16, No. 6, Nov. 1968.Google Scholar
  27. 27.
    Vazsonyi, A., “Economic Lot Size Formulas in Manufacturing”,Oper. Res., 5, 1 (Feb. 1957, 28–44.CrossRefGoogle Scholar
  28. 28.
    Wagner, Harvey, Principles of Operations Research, Prentice-Hall, N. J., Chapter 12, (1969), pp. 425–430.Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1973

Authors and Affiliations

  • Salah E. Elmaghraby
    • 1
  • Arup Mallik
    • 1
  1. 1.North Carolina State University and the University of West VirginiaRaleighUSA

Personalised recommendations