Download or read book Scheduling a Flowshop Manufacturing Cell with Sequence Dependent Setup Times written by Seyed Hamed Hendizadeh Naini and published by . This book was released on 2008 with total page 210 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Scheduling Optimization of Cellular Flowshop with Sequence Dependent Setup Times written by Al-mehdi Mohamed M. Ibrahem and published by . This book was released on 2014 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: In cellular manufacturing systems, minimization of the completion time has a great impact on the production time, material flow, and productivity. An effective scheduling is crucial to attaining the advantages of cellular manufacturing systems. This dissertation attempts to solve the Flowshop Manufacturing Cell (cellular flowshop) Scheduling Problem with Sequence Dependent Setup Times (FMCSP with SDSTs) considering two performance measures: the total flow time as a mono objective, and the makespan and total flow time combined as a bi-criteria scheduling problem. The proposed problem is known to be the NP-hard problem because of its complexity. Several metaheuristic algorithms based on Genetic Algorithm (GA), Simulated Annealing (SA), and Particle Swarm Optimization (PSO) are developed for scheduling part families as well as jobs within each part family for FMCSP with SDSTs to minimize the total flow time. A local search method based on SA combined with PSO (named as PSO-SA) is proposed to enhance the intensification and improve the quality of the solution obtained by pure PSO. The effectiveness and efficiency of the proposed metaheuristics are evaluated based on the Relative Percentage Deviation (RPD) from its lower bound, and the robustness. Results indicate PSO-SA is performed similar to best available algorithms for small and medium size test problems. Yet, there is a very small deviation from best results for large problems. A Multi-objective Particle Swarm Optimization (MPSO) and a Multi-objective Simulated Annealing (MOSA) Algorithm are further proposed to solve the bi-criteria optimization problem to minimize the total flow time and makespan simultaneously. An improved PSO is combined with Threshold Acceptance (TA) algorithm to improve effectiveness of the proposed MPSO (named as IMPSO-TA) for the convergence of the obtained Pareto Front. The proposed algorithms are evaluated using several Quality Indicators (QI) measures for multiobjective optimization problems. The proposed algorithms can generate approximated Pareto Fronts in a reasonable CPU time. The proposed IMPSO-SA outperforms MOSA algorithm in terms of CPU time and minimizing the objective functions.

Download or read book OPERATION LEVEL SEQUENCE DEPENDENT SETUP TIME REDUCTION IN DYNAMIC CELLULAR MANUFACTURING SYSTEMS written by Shahram Sharifi and published by . This book was released on 2012 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Production Planning and Scheduling for Lot Processing written by Larysa Burtseva and published by Cambridge Scholars Publishing. This book was released on 2022-07-29 with total page 429 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book is dedicated to questions of production planning and scheduling activities both in general and in semiconductor manufacturing environments, which have the characteristics of high volume and high mixture. It explores topics such as shop models, work-in-process management, the treatment of setup times, basic techniques of lot batching and splitting, lot sizing and group technology approaches, as well as rescheduling questions. A number of directions for further research is suggested in the book, and a broad collection of references is provided.

Download or read book Proceedings of the First International Conference on Genetic Algorithms and their Applications written by John J. Grefenstette and published by Psychology Press. This book was released on 2014-01-02 with total page 345 pages. Available in PDF, EPUB and Kindle. Book excerpt: Computer solutions to many difficult problems in science and engineering require the use of automatic search methods that consider a large number of possible solutions to the given problems. This book describes recent advances in the theory and practice of one such search method, called Genetic Algorithms. Genetic algorithms are evolutionary search techniques based on principles derived from natural population genetics, and are currently being applied to a variety of difficult problems in science, engineering, and artificial intelligence.

Download or read book Bi criteria Group Scheduling with Sequence dependent Setup Time in a Flow Shop written by Dongchen Lu and published by . This book was released on 2012 with total page 129 pages. Available in PDF, EPUB and Kindle. Book excerpt: Cellular manufacturing, which is also referred to as group technology among researchers, has primarily been used as a means to increase productivity, efficiency and flexibility. Under group technology, similar jobs, which have similar shape, material, and processing operations are assigned to the same group. Moreover, dissimilar machines are assigned to the same cell to meet the processing requirements of jobs in a group or multiple groups. Group scheduling problems have been studied extensively in the past as implementation of group technology became more prevalent in industry. However, most of the work that has been done has focused on single-criterion optimization. A bi-criteria group scheduling problem in a flow shop with sequence-dependent setup time is investigated in this research. Cellular manufacturing and flow shop are two popular scenarios in industry. To mimic real industry practice, dynamic job releases and dynamic machine availabilities are assumed. The goal is to minimize the weighted sum of total weighted completion time and total weighted tardiness, which satisfy the producer and customer goals separately. Normalized weights are assigned to both criteria to describe the trade-off between the two goals. Two different initial solution finding mechanisms are proposed, and a tabu-search based two-level search algorithm is developed to find near optimal solutions for the problem. An example problem is used to demonstrate the applicability of the search algorithm. A mathematical model is developed and implemented to evaluate the quality of the solutions obtained from the heuristics in small problem instances. Further, to uncover the difference in performance of initial solution finding mechanisms and heuristics, a detailed experimental design is performed. The results show that different heuristics have different performance in solving problems generated with different parameters.

Download or read book Metaheuristics for Production Scheduling written by Bassem Jarboui and published by John Wiley & Sons. This book was released on 2013-06-12 with total page 381 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book describes the potentialities of metaheuristics for solving production scheduling problems and the relationship between these two fields. For the past several years, there has been an increasing interest in using metaheuristic methods to solve scheduling problems. The main reasons for this are that such problems are generally hard to solve to optimality, as well as the fact that metaheuristics provide very good solutions in a reasonable time. The first part of the book presents eight applications of metaheuristics for solving various mono-objective scheduling problems. The second part is itself split into two, the first section being devoted to five multi-objective problems to which metaheuristics are adapted, while the second tackles various transportation problems related to the organization of production systems. Many real-world applications are presented by the authors, making this an invaluable resource for researchers and students in engineering, economics, mathematics and computer science. Contents 1. An Estimation of Distribution Algorithm for Solving Flow Shop Scheduling Problems with Sequence-dependent Family Setup Times, Mansour Eddaly, Bassem Jarboui, Radhouan Bouabda, Patrick Siarry and Abdelwaheb Rebaï. 2. Genetic Algorithms for Solving Flexible Job Shop Scheduling Problems, Imed Kacem. 3. A Hybrid GRASP-Differential Evolution Algorithm for Solving Flow Shop Scheduling Problems with No-Wait Constraints, Hanen Akrout, Bassem Jarboui, Patrick Siarry and Abdelwaheb Rebaï. 4. A Comparison of Local Search Metaheuristics for a Hierarchical Flow Shop Optimization Problem with Time Lags, Emna Dhouib, Jacques Teghem, Daniel Tuyttens and Taïcir Loukil. 5. Neutrality in Flow Shop Scheduling Problems: Landscape Structure and Local Search, Marie-Eléonore Marmion. 6. Evolutionary Metaheuristic Based on Genetic Algorithm: Application to Hybrid Flow Shop Problem with Availability Constraints, Nadia Chaaben, Racem Mellouli and Faouzi Masmoudi. 7. Models and Methods in Graph Coloration for Various Production Problems, Nicolas Zufferey. 8. Mathematical Programming and Heuristics for Scheduling Problems with Early and Tardy Penalties, Mustapha Ratli, Rachid Benmansour, Rita Macedo, Saïd Hanafi, Christophe Wilbaut. 9. Metaheuristics for Biobjective Flow Shop Scheduling, Matthieu Basseur and Arnaud Liefooghe. 10. Pareto Solution Strategies for the Industrial Car Sequencing Problem, Caroline Gagné, Arnaud Zinflou and Marc Gravel. 11. Multi-Objective Metaheuristics for the Joint Scheduling of Production and Maintenance, Ali Berrichi and Farouk Yalaoui. 12. Optimization via a Genetic Algorithm Parametrizing the AHP Method for Multicriteria Workshop Scheduling, Fouzia Ounnar, Patrick Pujo and Afef Denguir. 13. A Multicriteria Genetic Algorithm for the Resource-constrained Task Scheduling Problem, Olfa Dridi, Saoussen Krichen and Adel Guitouni. 14. Metaheuristics for the Solution of Vehicle Routing Problems in a Dynamic Context, Tienté Hsu, Gilles Gonçalves and Rémy Dupas. 15. Combination of a Metaheuristic and a Simulation Model for the Scheduling of Resource-constrained Transport Activities, Virginie André, Nathalie Grangeon and Sylvie Norre. 16. Vehicle Routing Problems with Scheduling Constraints, Rahma Lahyani, Frédéric Semet and Benoît Trouillet. 17. Metaheuristics for Job Shop Scheduling with Transportation, Qiao Zhang, Hervé Manier, Marie-Ange Manier. About the Authors Bassem Jarboui is Professor at the University of Sfax, Tunisia. Patrick Siarry is Professor at the Laboratoire Images, Signaux et Systèmes Intelligents (LISSI), University of Paris-Est Créteil, France. Jacques Teghem is Professor at the University of Mons, Belgium.

Download or read book Some Flow Shop Scheduling Problems Involving Sequence Dependent Setup Times written by Burton Decker Corwin and published by . This book was released on 1988 with total page 169 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Intelligent Scheduling of Robotic Flexible Assembly Cells written by Khalid Karam Abd and published by Springer. This book was released on 2015-11-08 with total page 175 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book focuses on the design of Robotic Flexible Assembly Cell (RFAC) with multi-robots. Its main contribution consists of a new effective strategy for scheduling RFAC in a multi-product assembly environment, in which dynamic status and multi-objective optimization problems occur. The developed strategy, which is based on a combination of advanced solution approaches such as simulation, fuzzy logic, system modeling and the Taguchi optimization method, fills an important knowledge gap in the current literature and paves the way for future research towards the goal of employing flexible assembly systems as effectively as possible despite the complexity of their scheduling.

Download or read book Handbook of Cellular Manufacturing Systems written by Shahrukh A. Irani and published by John Wiley & Sons. This book was released on 1999-04-15 with total page 784 pages. Available in PDF, EPUB and Kindle. Book excerpt: Cellular manufacturing (CM) is the grouping of similar products for manufacture in discrete multi-machine cells. It has been proven to yield faster production cycles, lower in-process inventory levels, and enhanced product quality. Pioneered on a large scale by Russian, British, and German manufacturers, interest in CM methods has grown steadily over the past decade. However, there continues to be a dearth of practical guides for industrial engineers and production managers interested in implementing CM techniques in their plants. Bringing together contributions by an international team of CM experts, the Handbook of Cellular Manufacturing Systems bridges this gap in the engineering literature.

Download or read book Scheduling Flexible Flowshops with Sequence Dependent Setup Times written by Kanchana Sethanan and published by . This book was released on 2001 with total page 181 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Journal of Applied Operational Research written by Kaveh Sheibani and published by ORLAB Analytics. This book was released on 2011-08-31 with total page 68 pages. Available in PDF, EPUB and Kindle. Book excerpt: We are pleased to welcome readers to this issue of the Journal of Applied Operational Research (JAOR), Volume 3, Number 2. The journal reports on developments in all aspects of operational research, including the latest advances and applications. It is a primarily goal of the journal to focus on and publish practical case studies which illustrate real-life applications.

Download or read book A Methodology for Scheduling Jobs in a Flexible Flowshop with Sequence Dependent Setup Times and Machine Skipping written by Vaibhav Pandya and published by . This book was released on 2011 with total page 178 pages. Available in PDF, EPUB and Kindle. Book excerpt: A flexible flowshop, comprised of one or more stages having unrelated parallel machines, is investigated in this research. Unrelated parallel machines can perform the same function but have different capacity or capability. Since this problem is motivated by industry research, dynamic job release times and dynamic machine availability times have been considered. Each job considered in this research can have different weight and due date. Sequence-dependent setup times of jobs further add to the complexity of the research. Machine skipping is yet another innate feature of this research that allows jobs to skip one or more stages depending upon customer's demand or budgetary constraints. The objective of this research is to minimize the sum of the weighted tardiness of all jobs released within the planning horizon. The research problem is modeled as a mixed (binary) integer-linear programming model and is shown to be strictly NP-hard. Being strongly NP-hard, industry size problems cannot be solved using an implicit enumeration technique within a reasonable computation time. Cognizant of the challenges in solving industry-size problems, we use the tabu-search-based heuristic solution algorithm to find optimal/near optimal solutions. Five different initial solution finding mechanisms, based on dispatching rules, have been developed, to initiate the search. The five initial solution finding mechanisms (IS1-IS5) have been used in conjunction with the six tabu-search-based heuristics (TS1-TS6) to solve the problems in an effective and efficient manner. The applicability of the search algorithm on an example problem has been demonstrated. The tabu-search based heuristics are tested on seven small problems and the quality of their solutions is compared to the optimal solutions obtained by the branch-and-bound technique. The evaluations show that the tabu-search based heuristics are capable of obtaining solutions of good quality within a much shorter computation time. The best performer among these heuristics recorded a percentage deviation of only 2.19%. The performance of the tabu-search based heuristics is compared by conducting a statistical experiment that is based on a randomized complete block design. Three sizes of problem structures ranging from 9 jobs to 55 jobs are used in the experiment. The results of the experiment suggest that no IS finding mechanism or TS algorithm contributed to identifying a better quality solution (i.e a lower TWT) for all three problem instances (i.e. small, medium and large). In other words, no IS finding mechanism or TS algorithm could statistically outperform others. In absence of a distinct outperformer, TS1 with short-term memory and fixed TLS are recommended for all problem instances. When comparing the efficiency of the search algorithm, the results of the experiment show that IS1, which refers to the EDD (earliest due date) method, is recommended as the initial solution generation method for small problem sizes. The EDD method is capable of obtaining an initial solution that helps the tabu-search based heuristic to get to the final solution within a short time. TS1 is recommended as the tabu-search based heuristic for large problems, in order to save on time. TS1 is also recommended to solve small and medium problem structures in absence of a statistically proven outperformer.

Download or read book Bi criteria Flow Shop Scheduling with Sequence Dependent Setup Time written by Sameer Sharma and published by . This book was released on 2016-02-11 with total page 72 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Naval Research Logistics Quarterly written by and published by . This book was released on 1974 with total page 168 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Handbook of Computational Intelligence in Manufacturing and Production Management written by Laha, Dipak and published by IGI Global. This book was released on 2007-11-30 with total page 516 pages. Available in PDF, EPUB and Kindle. Book excerpt: During the last two decades, computer and information technologies have forced great changes in the ways businesses manage operations in meeting the desired quality of products and services, customer demands, competition, and other challenges. The Handbook of Computational Intelligence in Manufacturing and Production Management focuses on new developments in computational intelligence in areas such as forecasting, scheduling, production planning, inventory control, and aggregate planning, among others. This comprehensive collection of research provides cutting-edge knowledge on information technology developments for both researchers and professionals in fields such as operations and production management, Web engineering, artificial intelligence, and information resources management.

Download or read book Variable Neighborhood Search for Flowshop Scheduling Problem with Sequence Dependent Setup Times written by Güneş Yılmaz and published by . This book was released on 2014 with total page 256 pages. Available in PDF, EPUB and Kindle. Book excerpt: