A Polynomial Time Branch and Bound Algorithm for the Single Item Economic Lot Sizing Problem with All Units Discount and Resale

The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the… CONTINUE READING