Scheduling in Random, Job Shop Type Flexible Manufacturing Systems PDF Download

Author: James Hal Hutchison
Publisher:
ISBN:
Category : Flexible manufacturing systems
Languages : en
Pages : 0

View

Book Description

Author: Jim Hutchison
Publisher:
ISBN:
Category : Flexible manufacturing systems
Languages : en
Pages : 12

View

Book Description

Author: Yeong-Dae Kim
Publisher:
ISBN:
Category :
Languages : en
Pages : 25

View

Book Description

Author: A. Raouf
Publisher: Elsevier
ISBN: 0080531695
Category : Technology & Engineering
Languages : en
Pages : 325

View

Book Description
Flexible Manufacturing Systems (FMS) involve substituting machines capable of performing a wide and redefinable variety of tasks for machines dedicated to the performance of specific tasks. FMS can also be programmed to handle new products, thus extending the machines' life cycles. Thus they represent a change from "standardized goods produced by customized machines" to "customized goods produced by standardized machines". This volume contains new and updated material in this field, and will be of great interest to researchers, managers and students concerned with problems related to flexible manufacturing systems.

Author: Philipp Wenzelburger
Publisher:
ISBN: 9783832555320
Category :
Languages : en
Pages : 0

View

Book Description
How can modern techniques from systems and control theory contribute to the developments in Industry 4.0 and in particular to the production scheduling of flexible manufacturing systems? Motivated by this very general research question, we develop a novel scheduling framework, in which we integrate the modeling and scheduling of flexible manufacturing systems. It allows exploiting the flexibility of manufacturing systems for the production of customer specific goods in the scope of Industry 4.0. The basis of the proposed framework is a modular description of the manufacturing system in the form of a flexible job shop. Automatic model generation algorithms lead to a Petri net model of the system, which enables systems theoretic analysis and the application of model predictive control (MPC), a modern feedback control method. In the MPC formulation of the scheduling problem, the economic goal of the manufacturing system is pursued. By considering feedback from the system, the MPC is able to react to unexpected changes in the manufacturing system and to make optimal use of the flexibility to adjust the production process. The advantages of the framework are its applicability to a wide range of scheduling problems, its ability to model and to exploit the available flexibility for economically optimal operation, and its guarantee to solve the production problem in closed loop operation.

Author: Ghaith Rabadi
Publisher: Springer
ISBN: 3319260243
Category : Business & Economics
Languages : en
Pages : 271

View

Book Description
The scope of this book is limited to heuristics, metaheuristics, and approximate methods and algorithms as applied to planning and scheduling problems. While it is not possible to give a comprehensive treatment of this topic in one book, the aim of this work is to provide the reader with a diverse set of planning and scheduling problems and different heuristic approaches to solve them. The problems range from traditional single stage and parallel machine problems to more modern settings such as robotic cells and flexible job shop networks. Furthermore, some chapters deal with deterministic problems while some others treat stochastic versions of the problems. Unlike most of the literature that deals with planning and scheduling problems in the manufacturing and production environments, in this book the environments were extended to nontraditional applications such as spatial scheduling (optimizing space over time), runway scheduling, and surgical scheduling. The solution methods used in the different chapters of the book also spread from well-established heuristics and metaheuristics such as Genetic Algorithms and Ant Colony Optimization to more recent ones such as Meta-RaPS.

Author: Jim Hutchison
Publisher:
ISBN:
Category : Flexible manufacturing systems
Languages : en
Pages : 19

View

Book Description

Author: James Chienliang Chen
Publisher:
ISBN:
Category :
Languages : en
Pages : 504

View

Book Description

Author: Li Zhu
Publisher:
ISBN:
Category :
Languages : en
Pages : 111

View

Book Description

Author: Adulwit Sonthinen
Publisher:
ISBN:
Category : Flexible manufacturing systems
Languages : en
Pages : 212

View

Book Description
Flexible Manufacturing Systems (FMSs) have evolved rapidly over the last decade. One important factor that influences the performance of FMS is scheduling. Scheduling in an FMS differs from that in a conventional job-shop because each operation of a job may be performed by any one of several machines. Most studies of scheduling in FMS in the past have assumed that each part has a unique process plan. However, in an actual manufacturing environment, it is possible for each part to have more than one process plan and each operation required of a part can be performed on alternative machines. In this thesis, the problem of scheduling parts in a General Flexible Manufacturing System (GFMS) in static environments is investigated when each part can have alternative process plans and each operation required of a part can be performed on alternative machines. The model and a solution algorithm have been developed for the problem. The mathematical model is formulated as the mixed-(binary) integer programming problem, and is proven NP-hard in the strong sense. An implicit-enumerative algorithm such as the branch-and-bound technique could not be used to find the optimal solution within a reasonable time even for a small-sized problem. The heuristic algorithm based on the concept known as tabu search is proposed to efficiently find the optimal/near-optimal solution for large-sized problems within a reasonable computational time. The steps involved with the heuristic algorithm and its application to an example problem are presented. Six different versions of tabu search-based heuristics (TSH 1-TSH 6) are compared to investigate the impact of using long-term memory and the use of fixed versus variable tabu-list sizes. A statistical experiment, based on randomized-block design, is carefully constructed to test the performance of the heuristics on 4 problem structures ranging from 4 parts to 14 parts. The results reveal that the tabu search-based heuristic with fixed tabu-list size and long-term memory (TSH 3) is preferred to other heuristics as the problem size increases. This research substantiates the fact that there is clearly a need for efficient heuristics to solve the complex scheduling problems in FMSs. One cannot rely on the implicit-enumerative procedure such as the branch-and-bound technique to solve problems that have practical significance.