Computational Intelligence in Flow Shop and Job Shop Scheduling PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Computational Intelligence in Flow Shop and Job Shop Scheduling PDF full book. Access full book title Computational Intelligence in Flow Shop and Job Shop Scheduling by Uday K. Chakraborty. Download full books in PDF and EPUB format.
Author: Uday K. Chakraborty Publisher: Springer Science & Business Media ISBN: 3642028357 Category : Mathematics Languages : en Pages : 348
Book Description
For over fifty years now, the famous problem of flow shop and job shop scheduling has been receiving the attention of researchers in operations research, engineering, and computer science. Over the past several years, there has been a spurt of interest in computational intelligence heuristics and metaheuristics for solving this problem. This book seeks to present a study of the state of the art in this field and also directions for future research.
Author: Uday K. Chakraborty Publisher: Springer Science & Business Media ISBN: 3642028357 Category : Mathematics Languages : en Pages : 348
Book Description
For over fifty years now, the famous problem of flow shop and job shop scheduling has been receiving the attention of researchers in operations research, engineering, and computer science. Over the past several years, there has been a spurt of interest in computational intelligence heuristics and metaheuristics for solving this problem. This book seeks to present a study of the state of the art in this field and also directions for future research.
Author: Frank Werner Publisher: MDPI ISBN: 3039284681 Category : Technology & Engineering Languages : en Pages : 200
Book Description
This edited book presents new results in the area of the development of exact and heuristic scheduling algorithms. It contains eight articles accepted for publication for a Special Issue in the journal Algorithms. The book presents new algorithms, e.g., for flow shop, job shop, and parallel machine scheduling problems. The particular articles address subjects such as a heuristic for the routing and scheduling problem with time windows, applied to the automotive industry in Mexico, a heuristic for the blocking job shop problem with tardiness minimization based on new neighborhood structures, fast heuristics for the Euclidean traveling salesman problem or a new mathematical model for the period-aggregated resource leveling problem with variable job duration, and several others.
Author: Yunqiang Yin Publisher: Springer Nature ISBN: 9811521050 Category : Mathematics Languages : en Pages : 198
Book Description
This book provides an introduction to the models, methods, and results of some due date-related scheduling problems in the field of multiagent scheduling. In multiagent scheduling, two or more agents share a common processing resource and each agent wants to optimize its own objective function with respect to its own set of jobs. Since the agents have conflicting objective functions, they have to negotiate among themselves with regard to sharing the common resource to optimize their own objective functions. A key feature of due date-related scheduling concerns the way in which due dates are considered: they can be given parameters or decision variables. For the former case, the motivation stems from the need to improve inventory and production management. For the latter case, due date assignment becomes a challenging issue since the decision-maker has to balance inventory holding costs against the benefits of fulfifilling orders in time. As for due dates, this book addresses the following three different scenarios: (i) The due dates of the jobs from either one or both of the two agents are decision variables, which are determined using some due date assignment models; (ii) The due dates of jobs in each job set are considered as given parameters, whereas which due date corresponds to a given job needs to determine; and (iii) The due date of each job is exogenously given. When the last case is involved, the objective function of each agent is related to the number of just-in-time jobs that are completed exactly on their due dates. For each considered scenario, depending on the model settings, and on the objective function of each agent, this book addresses the complexity, and the design of efficient exact or approximated algorithms. This book aims at introducing the author's research achievements in due date-related scheduling with two agents. It is written for researchers and Ph.D. students working in scheduling theory and other members of scientific community who are interested in recent scheduling models. Our goal is to enable the reader to know about some new achievements on this topic.
Author: Frank Werner Publisher: ISBN: 9783039284696 Category : Engineering (General). Civil engineering (General) Languages : en Pages : 200
Book Description
This edited book presents new results in the area of the development of exact and heuristic scheduling algorithms. It contains eight articles accepted for publication for a Special Issue in the journal Algorithms. The book presents new algorithms, e.g., for flow shop, job shop, and parallel machine scheduling problems. The particular articles address subjects such as a heuristic for the routing and scheduling problem with time windows, applied to the automotive industry in Mexico, a heuristic for the blocking job shop problem with tardiness minimization based on new neighborhood structures, fast heuristics for the Euclidean traveling salesman problem or a new mathematical model for the period-aggregated resource leveling problem with variable job duration, and several others.
Author: Stefka Fidanova Publisher: Springer Nature ISBN: 3030823970 Category : Technology & Engineering Languages : en Pages : 487
Book Description
This book presents recent advances in computational optimization. Our everyday life is unthinkable without optimization. We try to minimize our effort and to maximize the achieved profit. Many real-world and industrial problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks. The book is a comprehensive collection of extended contributions from the Workshops on Computational Optimization 2020. The book includes important real problems like modeling of physical processes, workforce planning, parameter settings for controlling different processes, transportation problems, wireless sensor networks, machine scheduling, air pollution modeling, solving multiple integrals and systems of differential equations which describe real processes, solving engineering problems. It shows how to develop algorithms for them based on new intelligent methods like evolutionary computations, ant colony optimization, constrain programming and others. This research demonstrates how some real-world problems arising in engineering, economics and other domains can be formulated as optimization problems.
Author: Roger Rios Publisher: Springer Science & Business Media ISBN: 1461411238 Category : Business & Economics Languages : en Pages : 312
Book Description
Whether different types of costs are to be reduced, benefits to be maximized or scarce resources to be managed, scheduling theory provides intelligent methods for practitioners and scientists. The just-in-time (JIT) production philosophy has enriched the classical scheduling theory with models that consider characteristics such as inventory costs, set-up times, lot sizing, or maintenance. This edited volume considers the specifics of just-in-time systems. It provides knowledge and insights on recent advances in scheduling theory where just-in-time aspects are considered. Contributions on models, theory, algorithms, and applications, that bring the theory up-to-date on the state-of-the-art of JIT systems are presented. Professionals, researchers and graduate students will find this book useful.
Author: Slawomir Koziel Publisher: Springer ISBN: 3319089854 Category : Mathematics Languages : en Pages : 339
Book Description
Computational complexity is a serious bottleneck for the design process in virtually any engineering area. While migration from prototyping and experimental-based design validation to verification using computer simulation models is inevitable and has a number of advantages, high computational costs of accurate, high-fidelity simulations can be a major issue that slows down the development of computer-aided design methodologies, particularly those exploiting automated design improvement procedures, e.g., numerical optimization. The continuous increase of available computational resources does not always translate into shortening of the design cycle because of the growing demand for higher accuracy and necessity to simulate larger and more complex systems. Accurate simulation of a single design of a given system may be as long as several hours, days or even weeks, which often makes design automation using conventional methods impractical or even prohibitive. Additional problems include numerical noise often present in the simulation data, possible presence of multiple locally optimum designs, as well as multiple conflicting objectives. In this edited book, various techniques that can alleviate solving computationally expensive engineering design problems are presented. One of the most promising approaches is the use of fast replacement models, so-called surrogates, that reliably represent the expensive, simulation-based model of the system/device of interest but they are much cheaper and analytically tractable. Here, a group of international experts summarize recent developments in the area and demonstrate applications in various disciplines of engineering and science. The main purpose of the work is to provide the basic concepts and formulations of the surrogate-based modeling and optimization paradigm, as well as discuss relevant modeling techniques, optimization algorithms and design procedures. Therefore, this book should be useful to researchers and engineers from any discipline where computationally heavy simulations are used on daily basis in the design process.
Author: Mohammad Mahdi Ahmadian Publisher: ISBN: Category : Languages : en Pages : 0
Book Description
An open-shop scheduling problem to minimize the total weighted earliness-tardiness of job-on-machine operations is studied. Each operation has its own due date, earliness weight and tardiness weight. An efficient relax-and-solve heuristic is developed. A feature that makes the proposed heuristic distinctive from the existing heuristics of this kind is that it operates by iterative relaxation and optimization of a series of sub-problems. Performance of the proposed heuristic is verified on a set of 72 benchmark instances with up to 200 operations, adapted from the literature on a similar job-shop scheduling problem. The heuristic delivers best solutions for nearly 71 % of the instances (i.e., 51 out of 72 instances), including the best solution for all instances with 150 and 200 operations. Its running time is around three minutes, while CLPEX was run for 30 minutes.
Author: Uday K. Chakraborty
Author: Uday K. Chakraborty
Author: Frank Werner
Author: Yunqiang Yin
Author: Frank Werner
Author: FrankWerner
Author: Stefka Fidanova
Author: Candace A. Yano, Yeong-Dae Kim
Author: Roger Rios
Author: Slawomir Koziel
Author: Mohammad Mahdi Ahmadian