Dynamic priority dispatching rules in job shops require the computation of all job priorities in a work center queue every time a machine in the work center becomes idle. This is extremely costly. Alternative priority update procedures are studied and comparative results in terms of performance...

We are concerned with scheduling several products that, require processing or a single machine. Routine application of the economic lot size formula to each product separately, often yields an infeasiable schedule in the sense that there are times when it specifies simultaneous production of two...

In the paper by Graves and Schwarz [Graves, Stephen C., Leroy B. Schwarz. 1977. Single cycle continuous review policies for arborescent production/inventory systems. Management Sci. 23 (5, January) 529-540.], we observed an error in their discussion of optimal policies for the one warehouse-m...