Read Books Online and Download eBooks, EPub, PDF, Mobi, Kindle, Text Full Free.
A Computational Procedure For The Multi Item Single Facility Lot Sizing Problem With Both Individual Product And Time Period Capacity Constraints
Download A Computational Procedure For The Multi Item Single Facility Lot Sizing Problem With Both Individual Product And Time Period Capacity Constraints full books in PDF, epub, and Kindle. Read online A Computational Procedure For The Multi Item Single Facility Lot Sizing Problem With Both Individual Product And Time Period Capacity Constraints ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Book Synopsis A Computational Procedure for the Multi-item Single Facility Lot Sizing Problem with Both Individual Product and Time Period Capacity Constraints by : Lynn S. Kondrot
Download or read book A Computational Procedure for the Multi-item Single Facility Lot Sizing Problem with Both Individual Product and Time Period Capacity Constraints written by Lynn S. Kondrot and published by . This book was released on 1986 with total page 140 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Book Synopsis Masters Theses in the Pure and Applied Sciences by : Wade H. Shafer
Download or read book Masters Theses in the Pure and Applied Sciences written by Wade H. Shafer and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 386 pages. Available in PDF, EPUB and Kindle. Book excerpt: Masters Theses in the Pure and Applied Sciences was first conceived, published, and disseminated by the Center for Information and Numerical Data Analysis and Synthesis (CINDAS) * at Purdue University in 1957, starting its coverage of theses with the academic year 1955. Beginning with Volume 13, the printing and dissemination phases of the activity were transferred to University Microfilms/Xerox of Ann Arbor, Michigan, with the thougtit that such an arrangement would be more beneficial to the academic and general scientific and technical community. After five years of this joint undertaking we had concluded that it was in the interest of all con cerned if the printing and distribution of the volumes were handled by an interna tional publishing house to assure improved service and broader dissemination. Hence, starting with Volume 18, Masters Theses in the Pure and Applied Sciences has been disseminated on a worldwide basis by Plenum Publishing Cor poration of New York, and in the same year the coverage was broadened to include Canadian universities. All back issues can also be ordered from Plenum. We have reported in Volume 31 (thesis year 1986) a total of 11 ,480 theses titles trom 24 Canadian and 182 United States universities. We are sure that this broader base tor these titles reported will greatly enhance the value ot this important annual reterence work. While Volume 31 reports theses submitted in 1986, on occasion, certain univer sities do re port theses submitted in previousyears but not reported at the time.
Book Synopsis Lot-sizing of Several Multi-product Families by : Tiffany Bayley
Download or read book Lot-sizing of Several Multi-product Families written by Tiffany Bayley and published by . This book was released on 2018 with total page 91 pages. Available in PDF, EPUB and Kindle. Book excerpt: Production planning problems and its variants are widely studied in operations management and optimization literature. One variation that has not garnered much attention is the presence of multiple production families in a coordinated and capacitated lot-sizing setting. While its single-family counterpart has been the subject of many advances in formulations and solution techniques, the latest published research on multiple family problems was over 25 years ago (Erenguc and Mercan, 1990; Mercan and Erenguc, 1993). Chapter 2 begins with a new formulation for this coordinated capacitated lot-sizing problem for multiple product families where demand is deterministic and time-varying. The problem considers setup and holding costs, where capacity constraints limit the number of individual item and family setup times and the amount of production in each period. We use a facility location reformulation to strengthen the lower bound of our demand-relaxed model. In addition, we combine Benders decomposition with an evolutionary algorithm to improve upper bounds on optimal solutions. To assess the performance of our approach, single-family problems are solved and results are compared to those produced by state-of-the-art heuristics by de Araujo et al. (2015) and Süral et al. (2009). For the multi-family setting, we first create a standard test bed of problems, then measure the performance of our heuristic against the SDW heuristic of Süral et al. (2009), as well as a Lagrangian approach. We show that our Benders approach combined with an evolutionary algorithm consistently achieves better bounds, reducing the duality gap compared to other single-family methods studied in the literature. Lot-sizing problems also exist within a vendor-managed-inventory setting, with production-planning, distribution and vehicle routing problems all solved simultaneously. By considering these decisions together, companies achieve reduced inventory and transportation costs compared to when these decisions are made sequentially. We present in Chapter 3 a branch-and-cut algorithm to tackle a production-routing problem (PRP) consisting of multiple products and customers served by a heterogeneous fleet of vehicles. To accelerate the performance of this algorithm, we also construct an upper bounding heuristic that quickly solves production-distribution and routing subproblems, providing a warm-start for the branch-and-cut procedure. In four scenarios, we vary the degree of flexibility in demand and transportation by considering split deliveries and backorders, two settings that are not commonly studied in the literature. We confirm that our upper bounding procedure generates high quality solutions at the root node for reasonably-sized problem instances; as time horizons grow longer, solution quality degrades slightly. Overall costs are roughly the same in these scenarios, though cost proportions vary. When backorders are not allowed (Scenarios 1 and 3), inventory holding costs account for over 90% of total costs and transportation costs contribute less than 0.01%. When backorders are allowed (Scenarios 2 and 4), most of the cost burden is shouldered by production, with transportation inching closer to 0.1% of total costs. In our fifth scenario for the PRP with multiple product families, we employ a decomposition heuristic for determining dedicated routes for distribution. Customers are clustered through k-means++ and a location-alloction subproblem based on their contribution to overall demand, and these clusters remain fixed over the entire planning horizon. A routing subproblem dictates the order in which to visit customers in each period, and we allow backorders in the production-distribution routine. While the branch-and-cut algorithm for Scenarios 1 through 4 quickly finds high quality solutions at the root node, Scenario 5's dedicated routes heuristic boasts high vehicle utilization and comparable overall costs with minimal computational effort.
Book Synopsis Capacitated Lot Sizing Problems in Process Industries by : Ravi Ramya
Download or read book Capacitated Lot Sizing Problems in Process Industries written by Ravi Ramya and published by Springer. This book was released on 2019-01-04 with total page 196 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book examines the Capacitated Lot Sizing Problem (CLSP) in process industries. In almost all process industries, there are situations where products have short/long setup times, and the setup of the product and its subsequent production are carried over, across consecutive periods. The setup of a product is carried over across more than one successive period in the case of products having long setup times. A product having short setup has its setup time less than the capacity of the period in which it is setup. The setup is immediately followed by its production of the product and it may also be carried over, across successive time period(s). Many process industries require production of a product to occur immediately after its setup (without the presence of idle time between the setup and production of the product), and they also require the product to be continuously produced without any interruption. This book considers a single-machine, single-level and multiple-item CLSP problem. This book introduces the Capacitated Lot Sizing Problem with Production Carryover and Setup Crossover across periods (CLSP-PCSC). Mathematical models are proposed which are all encompassing that they can handle continuous manufacturing (as in process industries), and also situations where the setup costs and holding costs are product dependent and time independent/time dependent, with possible backorders, and with other appropriate adaptations. Comprehensive heuristics are proposed based on these mathematical models to solve the CLSP-PCSC. The performance of the proposed models and heuristics are evaluated using problem instances of various sizes. This book also covers mathematical models developed for the Capacitated Lot Sizing Problem with Production Carryover and Setup Crossover across periods, and with Sequence-Dependent Setup Times and Setup Costs (CLSP-SD-PCSC). These models allow the presence of backorders and also address real-life situations present in process industries such as production of a product starting immediately after its setup and its uninterrupted production carryover across periods, along with the presence of short/long setup times. Heuristics proposed for the CLSP-PCSC can be extended to address the CLSP problem with sequence dependent setup costs and setup times. All the models and heuristics proposed in this book address some real-life considerations present in process industries.
Book Synopsis Multi-Level Capacitated Lotsizing with Setup Carryover by : Lisbeth Buschkühl
Download or read book Multi-Level Capacitated Lotsizing with Setup Carryover written by Lisbeth Buschkühl and published by Springer. This book was released on 2019-02-19 with total page 219 pages. Available in PDF, EPUB and Kindle. Book excerpt: Lotsizing problems are found in every company, which produces various items on resources with scarce capacities. In general, the objective is to find production plans, which meet demand with the resources` given capacities and at minimal costs. However, there is a great variety of company-specific lotsizing problems due to the complexity of the underlying production processes. Both standard MRP-systems and modern Advanced Planning Systems fail to provide adequate solutions. Instead, they most often compute production plans, which are not feasible in practice. In this book new lotsizing models are presented for multi-stage production systems with general product structures, dynamic demand, setup times and lead times. They are extended to cover production on parallel machines. An iterative solution procedure is presented, which generates feasible production plans within seconds of computation time. Potential readership includes scholars of supply chain management and production planning, interested students in these areas as well as practitioners involved in production planning.
Book Synopsis Multi-Level Lot Sizing and Scheduling by : Alf Kimms
Download or read book Multi-Level Lot Sizing and Scheduling written by Alf Kimms and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 367 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book is the outcome of my research in the field of multi levellot sizing and scheduling which started in May 1993 at the Christian-Albrechts-University of Kiel (Germany). During this time I discovered more and more interesting aspects ab out this subject and I had to learn that not every promising idea can be thoroughly evaluated by one person alone. Nevertheless, I am now in the position to present some results which are supposed to be useful for future endeavors. Since April 1995 the work was done with partial support from the research project no. Dr 170/4-1 from the "Deutsche For schungsgemeinschaft" (D FG). The remaining space in this preface shaH be dedicated to those who gave me valuable support: First, let me express my deep gratitude towards my thesis ad visor Prof. Dr. Andreas Drexl. He certainly is a very outstanding advisor. Without his steady suggestions, this work would not have come that far. Despite his scarce time capacities, he never rejected proof-reading draft versions of working papers, and he was always willing to discuss new ideas - the good as weH as the bad ones. He and Prof. Dr. Gerd Hansen refereed this thesis. I am in debted to both for their assessment. I am also owing something to Dr. Knut Haase. Since we al most never had the same opinion when discussing certain lot sizing aspects, his comments and criticism gave stimulating input.
Book Synopsis Production and Manufacturing System Management: Coordination Approaches and Multi-Site Planning by : Renna, Paolo
Download or read book Production and Manufacturing System Management: Coordination Approaches and Multi-Site Planning written by Renna, Paolo and published by IGI Global. This book was released on 2012-09-30 with total page 376 pages. Available in PDF, EPUB and Kindle. Book excerpt: "This book presents relevant theoretical frameworks and most recent research findings in this area, providing significant theories for research students and scholars to carry out their continuous research as well as practitioners who aim to improve upon their understanding of distributed production planning"--
Book Synopsis Computational Combinatorial Optimization by : Michael Jünger
Download or read book Computational Combinatorial Optimization written by Michael Jünger and published by Springer. This book was released on 2003-06-30 with total page 310 pages. Available in PDF, EPUB and Kindle. Book excerpt: This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.
Book Synopsis Multi-level Lot-sizing with a Bottleneck Work Center by : Peter J. Billington
Download or read book Multi-level Lot-sizing with a Bottleneck Work Center written by Peter J. Billington and published by . This book was released on 1983 with total page 602 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Book Synopsis Exact Methods for the Single-item Multi-plant Capacitated Lot Sizing Problem Coupled with Transportation by : Ayse Akbalik
Download or read book Exact Methods for the Single-item Multi-plant Capacitated Lot Sizing Problem Coupled with Transportation written by Ayse Akbalik and published by . This book was released on 2007 with total page 20 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Book Synopsis A FORWARD DYNAMIC PROGRAMMING APPROACH FOR GENERAL UNCAPACITATED MULTI-STAGE LOT-SIZING PROBLEMS by : JEFFREY M. ALDEN AND CANDACE ARAI YANO
Download or read book A FORWARD DYNAMIC PROGRAMMING APPROACH FOR GENERAL UNCAPACITATED MULTI-STAGE LOT-SIZING PROBLEMS written by JEFFREY M. ALDEN AND CANDACE ARAI YANO and published by . This book was released on 1986 with total page 28 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Book Synopsis Reverse Logistics by : Rommert Dekker
Download or read book Reverse Logistics written by Rommert Dekker and published by Springer Science & Business Media. This book was released on 2013-06-05 with total page 429 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book addresses decision making in reverse logistics, which concerns the integration of used and obsolete products back into the supply chain as valuable resources. It covers a wide range of aspects, related to distribution, production and inventory management, and supply chain management. For each topic, it highlights key managerial issues in real-life examples and explains which quantitative models are available for addressing them. By treating a broad range of issues in a unified way, the book offers the reader a comprehensive view on the field of reverse logistics.
Book Synopsis A Heuristic Solution Procedure for the Single Facility Multi-item Dynamic Lot Sizing and Sequencing Problem by : Ömer A. Aras
Download or read book A Heuristic Solution Procedure for the Single Facility Multi-item Dynamic Lot Sizing and Sequencing Problem written by Ömer A. Aras and published by . This book was released on 1981 with total page 410 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Book Synopsis Production Planning by Mixed Integer Programming by : Yves Pochet
Download or read book Production Planning by Mixed Integer Programming written by Yves Pochet and published by Springer Science & Business Media. This book was released on 2006-04-19 with total page 506 pages. Available in PDF, EPUB and Kindle. Book excerpt: This textbook provides a comprehensive modeling, reformulation and optimization approach for solving production planning and supply chain planning problems, covering topics from a basic introduction to planning systems, mixed integer programming (MIP) models and algorithms through the advanced description of mathematical results in polyhedral combinatorics required to solve these problems. Based on twenty years worth of research in which the authors have played a significant role, the book addresses real life industrial production planning problems (involving complex production structures with multiple production stages) using MIP modeling and reformulation approach. The book provides an introduction to MIP modeling and to planning systems, a unique collection of reformulation results, and an easy to use problem-solving library. This approach is demonstrated through a series of real life case studies, exercises and detailed illustrations. Review by Jakub Marecek (Computer Journal) The emphasis put on mixed integer rounding and mixing sets, heuristics in-built in general purpose integer programming solvers, as well as on decompositions and heuristics using integer programming should be praised... There is no doubt that this volume offers the present best introduction to integer programming formulations of lotsizing problems, encountered in production planning. (2007)
Book Synopsis A Multi-level Multi-item Capacitated Lot Sizing Problem (MLCLSP) Model by : Supakanya Chinprateep
Download or read book A Multi-level Multi-item Capacitated Lot Sizing Problem (MLCLSP) Model written by Supakanya Chinprateep and published by . This book was released on 2008 with total page 260 pages. Available in PDF, EPUB and Kindle. Book excerpt: This research was motivated by problems arising from manufacturing of end product from various raw materials. The firm also needs to take into account of other factors, for example: workstation capacity changes over time period; warehouse capacity; raw materials are affected by either availability or price and etc. The purchasing and production planning in multi-item multi-period multi-workstation capacitated lot size situation is discussed and formulated as a Mixed Integer Programming model (MIP) and can be called as a Multi-item Multi-level capacitated lot size with multi-workstation problem (MLCLSP-M). With too complexity of the solving large problem, three heuristic methods are developed, tested and compared based on standard library, illustrating the solution quality and computational time. The proposed heuristics are Assignment-Lot size heuristic (A-LS), Partial Assignment - Lot size (PA-LS), and Max Cover Period - Lot size (MCP-LS). These methods are based on the decomposition of the MLCLSP-M into two phases consisting of an assignment with given lot size phase and a lot size with given assignment phase. Each iteration, the sub problem mathematical models are solved with AMPL/CPLEX 8.0.0 solver. Computational test results are analyzed and discussed on performance and running time. On comparing with the original mathematical model solving, the results indicate that the A-LS heuristic gives a satisfactory solution with very fast solving time, the PA-LS heuristic gives a closely optimal solution with very long solving time, and the MCP-LS gives a good solution with medium solving time.
Book Synopsis Deterministic Lotsizing Models for Production Planning by : Marc Salomon
Download or read book Deterministic Lotsizing Models for Production Planning written by Marc Salomon and published by Springer. This book was released on 1991 with total page 176 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Book Synopsis Lead-times, Lot-sizes and Capacity Planning in MRP by : Peter J. Billington
Download or read book Lead-times, Lot-sizes and Capacity Planning in MRP written by Peter J. Billington and published by . This book was released on 1980 with total page 20 pages. Available in PDF, EPUB and Kindle. Book excerpt:
