Abstract
In a typical production scheduling problem, n parts must be fabricated using m machines, and each part must be fabricated in a given order on the machines. It is desired to schedule the parts so that the program is optimal with respect to some given criteria. In general, (n!)m programs must be examined. To obtain the ultimate solution, it is necessary to know for each part its actual time of fabrication on each machine. However, it is shown that without consideration of numerical values, it is possible to eliminate initially a great number of the possible programs by purely non-numerical methods. Operations Research, ISSN 0030-364X, was published as Journal of the Operations Research Society of America from 1952 to 1955 under ISSN 0096-3984.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
