A POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
Authors
Abstract:
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 excess units is possible at the ordering time. The properties of an optimal order policy are argued and on the basis of them, a branch and bound algorithm is presented to construct an optimal sequence of order policies. In the proposed B&B algorithm, some useful fathoming rules have been proven to make the algorithm very efficient. By defining a rooted tree graph, it has been shown that the worst-case time complexity function of the presented algorithm is polynomial. Finally, some test problems which are randomly generated in various environments are solved to show the efficiency of the algorithm.
similar resources
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 excess units is possible at the order...
full textA polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows
This paper deals with the single-item capacitated lot sizing problem with concave production and storage costs, considering minimum order quantity and dynamic time windows. This problem models a lot sizing where the production lots are constrained in amount and frequency. In this problem, a demand must be satisfied at each period t over a planning horizon of T periods. This demand can be satisf...
full textA New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time
Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...
full textA Vibration Damping Optimization Algorithm for Solving the Single-item Capacitated Lot-sizing Problem with Fuzzy Parameters
In this paper, we propose a vibration damping optimization algorithm to solve a fuzzy mathematical model for the single-item capacitated lot-sizing problem. At first, a fuzzy mathematical model for the single-item capacitated lot-sizing problem is presented. The possibility approach is chosen to convert the fuzzy mathematical model to crisp mathematical model. The obtained crisp model is in the...
full textPolynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
This paper presents two polynomial time algorithms for the constant capacitated lot sizing problem with a batch production. We give several optimality properties for the general problem. Assuming constant production capacity, constant batch size and WagnerWhitin cost structure, we derive O(T ) and O(T ) time algorithms respectively for the case with production capacity multiple of the batch siz...
full textPolynomial time algorithms for constant capacitated single-item lot sizing problem with stepwise production cost
This paper presents two polynomial time algorithms for the constant capacitated lot sizing problem with a batch production. We give several optimality properties for the general problem. Assuming constant production capacity, constant batch size and WagnerWhitin cost structure, we derive O(T 4) and O(T 6) time algorithms respectively for the case with production capacity multiple of the batch s...
full textMy Resources
Journal title
volume 2 issue 2
pages 183- 202
publication date 2012-06
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023