of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy DECOMPOSITION ALGORITHMS FOR TWO-STAGE STOCHASTIC INTEGER PROGRAMMING By John H. Penuel, Jr. August 2009 Chair: J. Cole Smith Major: Industrial and Systems Engineering Stochastic programming seeks to optimize decision making in uncertain...

In data envelopment analysis (DEA), mul-tiplier and envelopment CCR models eval-uate the decision-making units (DMUs) under optimal conditions. Therefore, the best prices are allocated to the inputs and outputs. Thus, if a given DMU was not efficient under optimal conditions, it would not be considered efficient by any other models. In the current study, using common weights in DEA, a number of...

Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs) which uses a set of inputs to produce a set of outputs. In some cases, DMUs have a two-stage structure, in which the first stage utilizes inputs to produce outputs used as the inputs of the second stage to produce final outputs. One important issue in two-stage DEA is the sensitivity of...

data envelopment analysis (dea) is a non-parametric technique for evaluation of relative efficiency of decision making units described by multiple inputs and outputs. it is based on solving linear programming problems. since 1978 when basic dea model was introduced many its modifications were formulated. among them are two or multi-stage models with serial or parallel structure often called net...

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

We study a class of chance-constrained two-stage stochastic optimization problems where second-stage feasible recourse decisions incur additional cost. In addition, we propose a new model, where “recovery” decisions are made for the infeasible scenarios to obtain feasible solutions to a relaxed second-stage problem. We develop decomposition algorithms with specialized optimality and feasibility...

Recently, sustainable supply chain management (SSCM) has become one of the important subjects in the industry and academia. Supplier selection, as a strategic decision, plays a significant role in SSCM. Researchers use different multi-criteria decision making (MCDM) methods to evaluate and select sustainable suppliers. In the previous studies, evaluation is solely based on the desirable feature...

this paper studies the multi-stage supply chain system (msscm) controlled by the kanban mechanism. in the kanban system, decision making is based on the number of kanbans as well as batch sizes. a kanban mechanism is employed to assist in linking different production processes in a supply chain system in order to implement the scope of just-in-time (jit) philosophy. for a msscm, a mixed-integer...

Problem statement: The most important character within optimization problem is the uncertainty of the future returns. Approach: To handle such problems, we utilized probabilistic methods alongside with optimization techniques. We developed single stage and two stage stochastic programming with recourse. The models were developed for risk adverse investors and the objective of the stochastic pro...