Download or read book The Two group Heuristic to Solve the Multi product Economic Lot Sizing and Scheduling Problem in Flow Shops written by Boctor, Fayez F. (Fayez Fouad) and published by Québec : Faculté des sciences de l'administration de l'Université Laval, Direction de la recherche. This book was released on 1998 with total page 22 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book The Multi product Economic Lot Sizing Problem in Flow Shops the Powers of two Heuristic written by Boctor, Fayez F. (Fayez Fouad) and published by Québec : Faculté des sciences de l'administration de l'Université Laval, Direction de la recherche. This book was released on 1998 with total page 18 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book The G group Heuristic to Solve the Multi product Sequencing Lot Sizing and Scheduling Problem in Flow Shops written by Boctor, Fayez F. (Fayez Fouad) and published by Québec : Faculté des sciences de l'administration de l'Université Laval, Direction de la recherche. This book was released on 1998 with total page 18 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Advances in Computational Intelligence in Transport Logistics and Supply Chain Management written by Andreas Fink and published by Springer Science & Business Media. This book was released on 2008 with total page 280 pages. Available in PDF, EPUB and Kindle. Book excerpt: The book at hand presents a careful selection of relevant applications of CI methods for transport, logistics, and supply chain management problems. The chapters illustrate the current state-of-the-art in the application of CI methods in these fields and should help and inspire researchers and practitioners to apply and develop efficient methods. A few contributions in this book are extended versions of papers presented at EvoTransLog2007: The First European Workshop on Evolutionary Computation in Transportation and Logistics which was held in Valencia, Spain, in 2007. The majority of contributions are from additional, specially selected researchers, who have done relevant work in different areas of transport, logistics, and supply chain management. The goal is to broadly cover representative applications in these fields as well as different types of solution approaches. On the application side, the contributions focus on design of traffic and transportation networks, vehicle routing, and other important aspects of supply chain management such as inventory management, lot sizing, and lot scheduling. On the method side, the contributions deal with evolutionary algorithms, local search approaches, and scatter search combined with other CI techniques such as neural networks or fuzzy approaches. The book is structured according to the application domains. Thus, it has three parts dealing with traffic and transportation networks, vehicle routing, and supply chain management.
Download or read book A New and Efficient Heuristic to Solve the Multi product Multi stage Lot Sizing and Scheduling Problem in Flow Shops written by Boctor, Fayez F. (Fayez Fouad) and published by Québec : Faculté des sciences de l'administration de l'Université Laval, Direction de la recherche. This book was released on 1998 with total page 17 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Multi Stage Simultaneous Lot Sizing and Scheduling written by Florian Seeanner and published by Springer Gabler. This book was released on 2013-05-29 with total page 182 pages. Available in PDF, EPUB and Kindle. Book excerpt: Due to a varying product demand (changing product mix) and different production speeds, bottlenecks may shift between the stages. In that case, a simultaneous lot-sizing and scheduling of these stages is recommendable. Hence, an improved version of the General Lot-Sizing and Scheduling Problem for Multiple production Stages (GLSPMS) was developed. Moreover, several reformulation techniques were applied to this model to solve it exactly. Besides, a new meta-heuristic which combines the principles of Variable Neighborhood Decomposition Search (VNDS) and Exchange was implemented to find good solutions, even for a real-world problem case. Finally, further model extensions, e.g., for scarce setup resources, were proposed.
Download or read book The Multi product Multi stage Lot Sizing and Scheduling Problem in Flow Shops written by Jamal Ouenniche and published by . This book was released on 1995 with total page 54 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Lot Sizing and Scheduling for Flexible Flow Lines written by Daniel Quadt and published by Springer Science & Business Media. This book was released on 2012-09-14 with total page 240 pages. Available in PDF, EPUB and Kindle. Book excerpt: The book considers the lot-sizing and scheduling problem for flexible flow line production facilities. Flexible flow lines are flow lines with parallel machines on some or all production stages. They can be found in a vast number of industries. A three-phased solution approach is presented that solves the integrated lot-sizing and scheduling problem in a hierarchical manner. The approach is able to handle several important features relevant in industrial practice, such as back-orders and setup carry-over. The developed solution procedures solve practically sized problems in a relatively short amount of time. One of the procedures is based on a novel mixed integer programming (MIP) model, which employs integer variables instead of binary variables. This makes it possible to find (near-)optimal solutions using standard algorithms such as CPLEX. Another procedure uses two nested Genetic Algorithms. An application of the framework in the semiconductor industry is given.
Download or read book Heuristics for the N product M stage Economic Lot Sizing and Scheduling Problem with Dynamic Demand written by Fayez Fouad Boctor and published by Québec : Faculté des sciences de l'administration de l'Université Laval, Direction de la recherche. This book was released on 2004 with total page 23 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book The Multi product Multi stage Lot Sizing and Scheduling Problem in Flow Shops written by Jamal Ouenniche and published by . This book was released on 1995 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:
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 240 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.
Download or read book Mathematical Reviews written by and published by . This book was released on 2005 with total page 1852 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book The Multi product Multi stage Lot Sizing and Scheduling Problem in Flow Shops written by Jamal Ouenniche and published by . This book was released on 1995 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book A Heuristic Approach to the Large Multi product Lot Size Scheduling Problem Considering Resource Leveling written by Lanny Arthur Karns and published by . This book was released on 1979 with total page 173 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book The Economic Lot Scheduling Problem written by Carol Wilcox Prevost and published by . This book was released on 1978 with total page 120 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Aanwinsten van de Centrale Bibliotheek Queteletfonds written by Bibliothèque centrale (Fonds Quetelet) and published by . This book was released on 2001 with total page 560 pages. Available in PDF, EPUB and Kindle. Book excerpt:
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.
