Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Manual Production Scheduling Algorithm

Graham K. Rand
Operational Research Quarterly (1970-1977)
Vol. 25, No. 4 (Dec., 1974), pp. 541-551
DOI: 10.2307/3008088
Stable URL: http://www.jstor.org/stable/3008088
Page Count: 11
  • Subscribe ($19.50)
  • Cite this Item
A Manual Production Scheduling Algorithm
Preview not available

Abstract

This paper describes a manual algorithm for determining optimal production schedules when there are linear costs associated with production and storage, demand is deterministic and there is no backlogging. The method is described for use in the one-product, one-line situation and extended for use in the multiproduct, one-line situation. Examples of the method, using work sheets, are given. A comparison is made with the formulation and solution of this problem using the transportation method of linear programming. The situation in which implementation took place is described, from which conclusions are drawn in relation to the use of this method in practice.

Page Thumbnails

  • Thumbnail: Page 
541
    541
  • Thumbnail: Page 
542
    542
  • Thumbnail: Page 
543
    543
  • Thumbnail: Page 
544
    544
  • Thumbnail: Page 
545
    545
  • Thumbnail: Page 
546
    546
  • Thumbnail: Page 
547
    547
  • Thumbnail: Page 
548
    548
  • Thumbnail: Page 
549
    549
  • Thumbnail: Page 
550
    550
  • Thumbnail: Page 
551
    551