Date of Award

9-7-2018

Degree Type

Dissertation

Degree Name

Ph.D.

Department

Industrial and Manufacturing Systems Engineering

First Advisor

Baki, Mohammed Fazle

Second Advisor

Azab, Ahmed

Keywords

Computational complexity, Dantzig-Wolfe decomposition, Emission control, Lot-sizing problem, Maximum Weighted Independent Set, Setup carryover

Rights

CC-BY-NC-ND

Abstract

Wagner and Whitin (1958) develop an algorithm to solve the dynamic Economic Lot-Sizing Problem (ELSP), which is widely applied in inventory control, production planning, and capacity planning. The original algorithm runs in O(T^2) time, where T is the number of periods of the problem instance. Afterward few linear-time algorithms have been developed to solve the Wagner-Whitin (WW) lot-sizing problem; examples include the ELSP and equivalent Single Machine Batch-Sizing Problem (SMBSP). This dissertation revisits the algorithms for ELSPs and SMBSPs under WW cost structure, presents a new efficient linear-time algorithm, and compares the developed algorithm against comparable ones in the literature. The developed algorithm employs both lists and stacks data structure, which is completely a different approach than the rest of the algorithms for ELSPs and SMBSPs. Analysis of the developed algorithm shows that it executes fewer number of basic actions throughout the algorithm and hence it improves the CPU time by a maximum of 51.40% for ELSPs and 29.03% for SMBSPs. It can be concluded that the new algorithm is faster than existing algorithms for both ELSPs and SMBSPs. Lot-sizing decisions are crucial because these decisions help the manufacturer determine the quantity and time to produce an item with a minimum cost. The efficiency and productivity of a system is completely dependent upon the right choice of lot-sizes. Therefore, developing and improving solution procedures for lot-sizing problems is key. This dissertation addresses the classical Multi-Level Capacitated Lot-Sizing Problem (MLCLSP) and an extension of the MLCLSP with a Setup Carryover, Backlogging and Emission control. An item Dantzig Wolfe (DW) decomposition technique with an embedded Column Generation (CG) procedure is used to solve the problem. The original problem is decomposed into a master problem and a number of subproblems, which are solved using dynamic programming approach. Since the subproblems are solved independently, the solution of the subproblems often becomes infeasible for the master problem. A multi-step iterative Capacity Allocation (CA) heuristic is used to tackle this infeasibility. A Linear Programming (LP) based improvement procedure is used to refine the solutions obtained from the heuristic method. A comparative study of the proposed heuristic for the first problem (MLCLSP) is conducted and the results demonstrate that the proposed heuristic provide less optimality gap in comparison with that obtained in the literature. The Setup Carryover Assignment Problem (SCAP), which consists of determining the setup carryover plan of multiple items for a given lot-size over a finite planning horizon is modelled as a problem of finding Maximum Weighted Independent Set (MWIS) in a chain of cliques. The SCAP is formulated using a clique constraint and it is proved that the incidence matrix of the SCAP has totally unimodular structure and the LP relaxation of the proposed SCAP formulation always provides integer optimum solution. Moreover, an alternative proof that the relaxed ILP guarantees integer solution is presented in this dissertation. Thus, the SCAP and the special case of the MWIS in a chain of cliques are solvable in polynomial time.

Share

COinS