Heuristic Scheduling Algorithms For Dedicated And Flexible Manufacturing Systems
Download Heuristic Scheduling Algorithms For Dedicated And Flexible Manufacturing Systems full books in PDF, epub, and Kindle. Read online free Heuristic Scheduling Algorithms For Dedicated And Flexible Manufacturing Systems ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Heuristic Scheduling Systems
Author | : Thomas E. Morton |
Publisher | : John Wiley & Sons |
Total Pages | : 718 |
Release | : 1993-09-10 |
Genre | : Business & Economics |
ISBN | : 9780471578192 |
Reflects exact and heuristic methods of scheduling techniques suitable for creating customized sequencing and scheduling systems for flexible manufacturing, project management, group and cellular manufacturing operations. Summarizes complex computational studies demonstrating how they work in practice. Contains new theories and techniques developed by the author. Includes a software disk to reinforce and practice the methods described.
Scheduling in Computer and Manufacturing Systems
Author | : Jacek Blazewicz |
Publisher | : Springer Science & Business Media |
Total Pages | : 321 |
Release | : 2012-12-06 |
Genre | : Business & Economics |
ISBN | : 3642790348 |
A theoretical and application-oriented analysis of deterministic scheduling problems arising in computer and manufacturing environments. The important classical results are surveyed with particular attention paid to single-processor scheduling, along with general models such as resource-constrained scheduling, flexible flow shops, dynamic job shops, and special flexible manufacturing systems. Polynomial and exponential-time optimization algorithms as well as approximation and heuristic ones are presented using a Pascal-like notation, before being discussed in the light of particular problems. Basic concepts from scheduling theory and related fields are described to assist less advanced readers.
Flexible Manufacturing Systems: Recent Developments
Author | : A. Raouf |
Publisher | : Elsevier |
Total Pages | : 325 |
Release | : 1995-02-09 |
Genre | : Technology & Engineering |
ISBN | : 0080531695 |
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.
An Efficient Methodology for Scheduling General Flexible Manufacturing Systems
Author | : Adulwit Sonthinen |
Publisher | : |
Total Pages | : 212 |
Release | : 1995 |
Genre | : Flexible manufacturing systems |
ISBN | : |
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.
Handbook on Scheduling
Author | : Jacek Błażewicz |
Publisher | : Springer Science & Business Media |
Total Pages | : 654 |
Release | : 2007-06-12 |
Genre | : Business & Economics |
ISBN | : 3540280464 |
This book provides a theoretical and application-oriented analysis of deterministic scheduling problems in advanced planning and computer systems. The text examines scheduling problems across a range of parameters: job priority, release times, due dates, processing times, precedence constraints, resource usage and more, focusing on such topics as computer systems and supply chain management. Discussion includes single and parallel processors, flexible shops and manufacturing systems, and resource-constrained project scheduling. Many applications from industry and service operations management and case studies are described. The handbook will be useful to a broad audience, from researchers to practitioners, graduate and advanced undergraduate students.
Exact and Heuristic Scheduling Algorithms
Author | : Frank Werner |
Publisher | : MDPI |
Total Pages | : 200 |
Release | : 2020-03-18 |
Genre | : Technology & Engineering |
ISBN | : 3039284681 |
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.