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...

Ecological environmental security in karst areas is an issue of global concern. Identifying the ecological landscape pattern (ELSP) key to promoting protection and alleviating land development utilization impacts. sources (ESs) corridors (ECs) are important bases for constructing ELSP. We used five influencing factors (land use type, digital elevation model (DEM), rocky desertification degree, ...

Article history: Received 1 August 2011 Accepted 28 October 2011 Available online 29 October 2011 Recently, the economic lot scheduling problem (ELSP) with common cycle time and shelf life restrictions has attracted the attention of several researchers. In this paper, a comparative study of solutions given by Xu and Sarker (2003) [Computers & Operations Research 30 (6), 925938] with the results...

The aim of this work is to propose a mathematical programming model for the Economic Lot Scheduling Problem (ELSP) with performance decay. The main difficulties related to this model are the nonlinearities and/or nonconvexities associated with the dynamic behavior of the system with time. Firstly, the problem is formulated as a Mixed Integer Non Linear Program (MINLP), which is found to be nonc...

The economic lot scheduling problem (ELSP) addresses the problem of scheduling several items each with its own static, deterministic demand at a single facility, where only one item can be produced at any time. This classical production planning problem has been studied extensively over the last three decades and various heuristic solution methods have been proposed, most of them based on the c...

This paper considers the Economic Lot Scheduling Problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. Combination of frequency and timing as well as production quantity make this problem Np-hard. A heuristic is developed to obtain a good solution to ELSP. The proposed heuristic makes use of the Simulated Annealing Technique...

This paper considers the Economic Lot Scheduling Problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. Combination of frequency and timing as well as production quantity make this problem Np-hard. A heuristic is developed to obtain a good solution to ELSP. The proposed heuristic makes use of the Simulated Annealing Technique...

this paper considers the economic lot scheduling problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. combination of frequency and timing as well as production quantity make this problem np-hard. a heuristic is developed to obtain a good solution to elsp. the proposed heuristic makes use of the simulated annealing technique...

We formulate the well-known economic lot scheduling problem (ELSP) with sequence dependent setup times and costs as a semi-Markov decision process. Using an affine approximation of the bias function, we obtain a semi-infinite linear program determining a lower bound for the minimum average cost rate. Under a very mild condition, we can reduce this problem to a relatively small convex quadratica...