Economic lot size scheduling problem (ELSP) for a multi-product single machine system is a classical problem. This paper considers ELSP with budgetary constraint as an important aspect of such systems. In the real world situations the available funds for investment in inventory is limited. By adopting the common cycle time approach to ELSP, we obtain the optimal common cycle which minimizes the...

Loading and hauling machineries are highly capital intensive equipment to procure, operate and maintain in surface mining operation. It must be borne in mind that with this huge and capital-intensive equipment, every second of its life time is absolutely important from the production and productivity point of view. As such, it is imperative to optimize the overall cycle time and speed factor of...

Sequencing batch reactor (SBR) technology has found many applications in industrial wastewater treatment in recent years. The aim of this study was to determine the optimal time for a cycle of the sequencing batch reactor (SBR) and evaluate the performance of a SBR for petrochemical wastewater treatment in that cycle time. The reactor was operated with a suspended biomass configuration under ae...

Inventory models in which the demand rate dependents on the stock- dependent are based on the common real- life observation that greater product availability tends to stimulate more sales. In this study we develop an inventory model to determine an optimal ordering policy for quantity dependent demand rate and time dependent holding cost items with delay in payments permitted by the supplier un...

when the degree of saturation at intersection approaches one, webster’s optimum cycle length equation becomes inapplicable, because the cycle length will becomes very big when the degree of saturation approaches one and will be fully unrealistic when the degree of saturation becomes greater than one. this is not a problem for hcm2000 method. but optimum cycle length calculation in this method h...

The dater equalities constitutes an appropriate tool which allows a linear description of Timed Event Graphs in the field of (max, +) algebra. This paper proposes an equivalent model in the usual algebra which can describe Timed and P-time Event Graphs. Considering 1-periodic behavior, the application of a variant of Farkas’ lemma allows the determination of upper and lower bounds of the produc...

Cycle time optimization could be one of the great challenges in business process management. Although there is much research on this subject, task similarities have been paid little attention. In this paper, a new approach is proposed to optimize cycle time by minimizing entropy of work lists in resource allocation while keeping workloads balanced. The idea of the entropy of work lists comes fr...