The economic lot scheduling problem under power-of-two policy

Yao, Ming-Jong; Elmaghraby, Salah E.

doi:10.1016/s0898-1221(01)00103-1

Cited by 42 publications

(26 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Haessler [9] improved the generalized BP policy and allowed the machine time of any number of consecutive basic periods to be pooled together for production consideration. This policy is called the extended basic period (EBP) policy in Lopez and Kingsman [11], and Yao and Elmaghraby [14], which is also the policy used in this paper. For solving the ELSP, many other heuristic approaches have also been proposed by Boctor [1], Doll and Whybark [5], Geng and Vickson [7] and Madigan [12].…”

Section: Introductionmentioning

confidence: 99%

The economic lot scheduling problem under extended basic period and power-of-two policy

Sun¹,

Huang

Jaruphongsa

2009

Optim Lett

View full text Add to dashboard Cite

The economic lot scheduling problem schedules the production of several different products on a single machine over an infinite planning horizon. In this paper, a nonlinear integer programming model is used to determine the optimal solution under the extended basic period and power-of-two policy. A small-step search algorithm is presented to find a solution which approaches optimal when the step size approaches zero, where a divide-and-conquer procedure is introduced to speed up the search. Further, a faster heuristic algorithm is proposed which finds the same solutions in almost all the randomly generated sample cases.

show abstract

Section: Introductionmentioning

confidence: 99%

The economic lot scheduling problem under extended basic period and power-of-two policy

Sun¹,

Huang

Jaruphongsa

2009

Optim Lett

View full text Add to dashboard Cite

show abstract

“…This problem addresses lot-scheduling of several items with static and deterministic demands over an infinite planning horizon at a single facility, where products are delivered to the customer continuously. Researches on the ELSP usually have focused on cyclic schedules with three well known policies: common cycle, basic period (or multiple cycle) and time varying lot size approaches [15]. Several authors have extended the ELSP to multistage production systems with common cycle production policy [9, 10, 4, and 14].…”

Section: Introductionmentioning

confidence: 99%

“…Its main difference with the Bomberger's BP method was that it allowed items to be loaded on two BPs simultaneously and at the same time relaxed the requirement that the basic period should be large enough to accommodate such simultaneous loading. Yao and Elmaghraby [15] developed an evolutionary algorithm for ELSP under basic period policy. Ouenniche and Boctor [11, 12 and 13] proposed three efficient heuristic approaches, i.e.…”

Section: Introductionmentioning

confidence: 99%

A hybrid GA for a supply chain production planning problem

Jenabi

Torabi

Mansouri

2007

Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation

View full text Add to dashboard Cite

The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single supplier produces several items on a flexible flow line (FFL) production system and delivers them directly to an assembly facility. Based on the wellknown basic period (BP) policy, a new mixed zero-one nonlinear programming model has been developed to minimize average setup, inventory-holding and delivery costs per unit time in the supply chain without any stock-out. The problem is very complex and it could not be solved to optimality especially in real-sized problems. So, an efficient hybrid genetic algorithm (HGA) using the most applied BP approach (i.e. power-of-two policy) has been proposed. The solution quality of the proposed algorithm called PT-HGA has been evaluated and compared with the common cycle approach in some problem instances. Numerical experiments demonstrate the merit of the PT-HGA and indicate that it is a very promising solution method for the problem.

show abstract

“…We denoted the ELSP without capacity constraints under GI policy as the "unconstrained ELSP" for the rest of the paper. This research is motivated by a recent work by Yao and Elmaghraby (2001) in which they study the optimality structure of the ELSP without capacity constraints under Power-of-Two (PoT) policy in which they limit k i to be k i = 2 m i , where m i 0, m i : integer, ∀i. We denote the ELSP without capacity constraints under PoT policy as the unconstrained ELSP (PoT).…”

Section: Introductionmentioning

confidence: 99%

“…However, we will demonstrate later that the optimality structure of the unconstrained ELSP can be easily explored. Our study in this paper is to fill this gap in the literature by extending Yao and Elmaghraby's (2001) results (under PoT policy) to GI policy. The comprehensive analysis on the unconstrained ELSP in this paper shall provide more insights into the optimality structure of the conventional (capacitated) ELSP, and the theoretical results for the unconstrained ELSP will lay foundation for deriving more effective search heuristics to solve the conventional ELSP.…”

Section: Introductionmentioning

confidence: 99%

The Economic Lot Scheduling Problem without Capacity Constraints

Yao

2005

Ann Oper Res

Self Cite

View full text Add to dashboard Cite

This study presents a comprehensive analysis on the Economic Lot Scheduling Problem (ELSP) without capacity constraints. We explore the optimality structure of the ELSP without capacity constraints and discover that the curve for the optimal objective values is piecewise convex with repsect to B, i.e., the values of basic period. The theoretical properties of the junction points on the piecewise convex curve not only provides us the information on "which product i" to modify, but also on "where on the B-axis" to change the set of optimal multpliers in the search process. By making use of the junction points, we propose an effective search algorithm to secure a global optimal solution for the ELSP without capacity constraints. Also, we use random experiments to verify that the proposed algorithm is efficient. The results in this paper lay important foundation for deriving an efficient heuristic to solve the conventional ELSP with capacity constraints.

show abstract

The economic lot scheduling problem under power-of-two policy

Cited by 42 publications

References 18 publications

The economic lot scheduling problem under extended basic period and power-of-two policy

The economic lot scheduling problem under extended basic period and power-of-two policy

A hybrid GA for a supply chain production planning problem

The Economic Lot Scheduling Problem without Capacity Constraints

Contact Info

Product

Resources

About