EBookClubs

Read Books & Download eBooks Full Online

EBookClubs

Read Books & Download eBooks Full Online

Book Bi criteria Group Scheduling with Sequence dependent Setup Time in a Flow Shop

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.

Book Bi criteria Flow Shop Scheduling with Sequence Dependent Setup Time

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:

Book Bi criteria Group Scheduling with Learning in Hybrid Flow Shops

Download or read book Bi criteria Group Scheduling with Learning in Hybrid Flow Shops written by Mir Abbas Bozorgirad and published by . This book was released on 2013 with total page 127 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this research, a bi-criteria group scheduling problem is investigated in hybrid flow shop (HFS) environments, where the parallel machines in each stage are unrelated, meaning not identical. The objective of the problem is to minimize a linear combination of the total weighted completion times as a means of complying with the interests of the producer, and the total weighted tardiness as a means of complying with the interests of customers. The underlying assumptions of the problem include the group technology assumptions (GTA) that require all jobs within a group to be processed successively and on the same machine. The runtime of these jobs are dynamic and progressively decrease as the worker learns how to perform similar jobs. A sequence-dependent setup time is considered for switching between different groups on the same machine. Although all jobs have to move in unidirectional paths through the HFS, some may skip some of the stages. Furthermore, in order to capture more realistic features of the scheduling problems, the jobs are assumed to be released into the system at dynamic times, and the machines, as well, are assumed to be available at dynamic times. The problem is formulated as a mixed-integer linear programming (MILP) model. The MILP model for small sizes of the problem is solved to optimality using CPLEX. However, since the problem is strongly NP-hard, it is not possible to find its optimal solution within a reasonable time as the problem size increases to medium to large. Several meta-heuristic algorithms based on tabu search (TS), simulated annealing (SA), and genetic algorithm (GA) are developed to find the optimal/near optimal solutions for this problem. Three alterations of algorithms are developed for TS and SA-based algorithms (referred to as local search algorithms) i.e. non-permutation, partial permutation and local searches with embedded progressive perturbations. Two alternatives are also considered for GA-based algorithms (referred to as population-based algorithms) i.e. simple GA and bi-level GA. The performances of these algorithms are compared to each other in order to identify which algorithm, if any, outperforms the others. Nevertheless, the performances of all algorithms are evaluated with respect to a tight lower bound (LB) obtained based on a branch-and-price (B & P) technique developed in this research. The B & P technique uses Dantzig-Wolfe decomposition to divide the original problem into a master problem and several sub-problems. Although, the sub-problems are smaller than the original problem, they are still strongly NP-hard and cannot be optimally solved within a reasonable amount of time. However, an optimal dispatching rule is proposed that drastically reduces the number of variables and constraints in these sub-problems, and enables the B & P algorithm to find tight lower bounds even for large-size instances of the problem. A comparison between these lower bounds and the ones obtained from CPLEX reveals the impressive performance of the B & P algorithm, i.e. an average of 233% improvement for the largest size of the problems that have been tested. Evaluation of the proposed algorithms with respect to these tight lower bounds uncovers the outstanding performance of all the proposed algorithms, while identifying the bi-level GA as the best performing algorithm in dealing with the HFS scheduling problem. This algorithm reports a remarkable performance with an average deviation of only 2% from the optimal solution for small-size sample problems, and an average gap of 23% from the lower bound for the largest sizes of the tested problems. The largest problem tested in this research consists of a total of 1858 binary variables and 14654 constraints.

Book Some Flow Shop Scheduling Problems Involving Sequence Dependent Setup Times

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:

Book Proceedings of the First International Conference on Genetic Algorithms and their Applications

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.

Book Handbook of Research on Artificial Intelligence Techniques and Algorithms

Download or read book Handbook of Research on Artificial Intelligence Techniques and Algorithms written by Vasant, Pandian and published by IGI Global. This book was released on 2014-11-30 with total page 873 pages. Available in PDF, EPUB and Kindle. Book excerpt: For decades, optimization methods such as Fuzzy Logic, Artificial Neural Networks, Firefly, Simulated annealing, and Tabu search, have been capable of handling and tackling a wide range of real-world application problems in society and nature. Analysts have turned to these problem-solving techniques in the event during natural disasters and chaotic systems research. The Handbook of Research on Artificial Intelligence Techniques and Algorithms highlights the cutting edge developments in this promising research area. This premier reference work applies Meta-heuristics Optimization (MO) Techniques to real world problems in a variety of fields including business, logistics, computer science, engineering, and government. This work is particularly relevant to researchers, scientists, decision-makers, managers, and practitioners.

Book Principles of Sequencing and Scheduling

Download or read book Principles of Sequencing and Scheduling written by Kenneth R. Baker and published by John Wiley & Sons. This book was released on 2013-06-05 with total page 407 pages. Available in PDF, EPUB and Kindle. Book excerpt: An up-to-date and comprehensive treatment of the fundamentals of scheduling theory, including recent advances and state-of-the-art topics Principles of Sequencing and Scheduling strikes a unique balance between theory and practice, providing an accessible introduction to the concepts, methods, and results of scheduling theory and its core topics. With real-world examples and up-to-date modeling techniques, the book equips readers with the basic knowledge needed for understanding scheduling theory and delving into its applications. The authors begin with an introduction and overview of sequencing and scheduling, including single-machine sequencing, optimization and heuristic solution methods, and models with earliness and tardiness penalties. The most current material on stochastic scheduling, including correct scheduling of safety time and the use of simulation for optimization, is then presented and integrated with deterministic models. Additional topical coverage includes: Extensions of the basic model Parallel-machine models Flow shop scheduling Scheduling groups of jobs The job shop problem Simulation models for the dynamic job shop Network methods for project scheduling Resource-constrained project scheduling Stochastic and safe scheduling Extensive end-of-chapter exercises are provided, some of which are spreadsheet-oriented, and link scheduling theory to the most popular analytic platform among today's students and practitioners—the Microsoft Office Excel® spreadsheet. Extensive references direct readers to additional literature, and the book's related Web site houses material that reinforces the book's concepts, including research notes, data sets, and examples from the text. Principles of Sequencing and Scheduling is an excellent book for courses on sequencing and scheduling at the upper-undergraduate and graduate levels. It is also a valuable reference for researchers and practitioners in the fields of statistics, computer science, operations research, and engineering.

Book Multi Criteria SDST Flow Shop Scheduling

Download or read book Multi Criteria SDST Flow Shop Scheduling written by Ashwani Dhingra and published by LAP Lambert Academic Publishing. This book was released on 2012 with total page 152 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book contains some aspects of flow shop scheduling problems including sequence dependent set up time with minimization of multi-criteria fitness function.There are different criteria's which have to be optimized for the customer and industrial requirement. The present work dealt with multi-criteria fitness function which includes weighted sum of total weighted squared tardiness, Makespan, Total weighted earliness and number of tardy jobs.Multi-criteria fitness function is very difficult to be optimised as there is tradeoff between different criteria. Metaheuristic like genetic algorithm and simulated annealing is a powerful techniques for the solution of such type of scheduling problems. Hybridization of different metaheuristic such as Genetic algorithm and simulated annealing has also been proposed for such type of scheduling problems. These metaheuristics tested proves to be powerful methods for solution to these type of NP hard problems in a reasonable time.

Book Some Deterministic Flowshop Scheduling Models

Download or read book Some Deterministic Flowshop Scheduling Models written by Neelam Tyagi and published by LAP Lambert Academic Publishing. This book was released on 2012 with total page 80 pages. Available in PDF, EPUB and Kindle. Book excerpt: Sequencing / Scheduling is an important process widely used in manufacturing, production, management, computer science and so on. Appropriate scheduling not only reduces manufacturing costs but also reduces possibilities for violating due dates. The present dissertation deals with the concept and applications of flow shop sequencing and scheduling model .The flow shop scheduling has been a very active and prolific research area since the seminal paper of Johnson (1954). The flow shop scheduling problem is a production problem where a set of n jobs have to be processed with identical flow pattern on m machines. In this memoir we have made an attempt to discussed some methods/approach used in flow shop scheduling/sequencing such as heuristic and meta heuristic approach, Longest - Processing Time (LPT) and the PALMER approaches for group flexible flow shop scheduling problems, flow shop sequencing with transportation time of jobs and parallel and unrelated parallel machine scheduling problems.In scheduling problems we must determine the order or sequence for processing a set of jobs through several machines in an optimal manner.

Book Foundations of Bilevel Programming

Download or read book Foundations of Bilevel Programming written by Stephan Dempe and published by Springer Science & Business Media. This book was released on 2005-12-19 with total page 318 pages. Available in PDF, EPUB and Kindle. Book excerpt: Bilevel programming problems are hierarchical optimization problems where the constraints of one problem (the so-called upper level problem) are defined in part by a second parametric optimization problem (the lower level problem). If the lower level problem has a unique optimal solution for all parameter values, this problem is equivalent to a one-level optimization problem having an implicitly defined objective function. Special emphasize in the book is on problems having non-unique lower level optimal solutions, the optimistic (or weak) and the pessimistic (or strong) approaches are discussed. The book starts with the required results in parametric nonlinear optimization. This is followed by the main theoretical results including necessary and sufficient optimality conditions and solution algorithms for bilevel problems. Stationarity conditions can be applied to the lower level problem to transform the optimistic bilevel programming problem into a one-level problem. Properties of the resulting problem are highlighted and its relation to the bilevel problem is investigated. Stability properties, numerical complexity, and problems having additional integrality conditions on the variables are also discussed. Audience: Applied mathematicians and economists working in optimization, operations research, and economic modelling. Students interested in optimization will also find this book useful.

Book Algorithms for Scheduling Problems

Download or read book Algorithms for Scheduling Problems written by FrankWerner and published by MDPI. This book was released on 2018-08-24 with total page 209 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book is a printed edition of the Special Issue " Algorithms for Scheduling Problems" that was published in Algorithms

Book Naval Research Logistics Quarterly

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:

Book Intelligent Decision Making  An AI Based Approach

Download or read book Intelligent Decision Making An AI Based Approach written by Gloria Phillips-Wren and published by Springer Science & Business Media. This book was released on 2008-03-04 with total page 414 pages. Available in PDF, EPUB and Kindle. Book excerpt: Intelligent Decision Support Systems have the potential to transform human decision making by combining research in artificial intelligence, information technology, and systems engineering. The field of intelligent decision making is expanding rapidly due, in part, to advances in artificial intelligence and network-centric environments that can deliver the technology. Communication and coordination between dispersed systems can deliver just-in-time information, real-time processing, collaborative environments, and globally up-to-date information to a human decision maker. At the same time, artificial intelligence techniques have demonstrated that they have matured sufficiently to provide computational assistance to humans in practical applications. This book includes contributions from leading researchers in the field beginning with the foundations of human decision making and the complexity of the human cognitive system. Researchers contrast human and artificial intelligence, survey computational intelligence, present pragmatic systems, and discuss future trends. This book will be an invaluable resource to anyone interested in the current state of knowledge and key research gaps in the rapidly developing field of intelligent decision support.

Book Flow Shop Scheduling

Download or read book Flow Shop Scheduling written by Hamilton Emmons and published by Springer. This book was released on 2012-09-14 with total page 334 pages. Available in PDF, EPUB and Kindle. Book excerpt: Although several monographs and edited volumes have discussed scheduling in general, most of these works survey the field by contributing a single chapter to production systems like flow shops. Flow Shop Scheduling: Theoretical Results, Algorithms, and Applications is solely dedicated to bringing together a huge body of knowledge on the subject, along distinct design features, in order to help scholars and practitioners easily identify problems of interest. This monograph has been organized into ten distinct flow shop systems and explores their connections. The chapters cover flow shop systems including two-machine, flexible, stochastic, and more. Outside of the traditional flow shops that require a job never revisits any stage, this book also examines the reentrant flow shop, in which a job may cycle back and be reprocessed at the same station or sequence of stations, multiple times. The authors have made the material accessible to a broad readership, using simplified notation and revealing unifying concepts. The results unique to flow shop research should provide the seed for research in other areas of scheduling and in optimization in general.

Book Scheduling a Flowshop Manufacturing Cell with Sequence Dependent Setup Times

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:

Book Journal of Zhejiang University

Download or read book Journal of Zhejiang University written by and published by . This book was released on 2005 with total page 172 pages. Available in PDF, EPUB and Kindle. Book excerpt: