Abstract
Abstract Flexible assembly systems (FAS) promise to be an efficient processing approach for producing small and medium-sized batches of products. One vitally important element which affects the achievement of high performance by the FAS is its scheduling/dispatching component operating within the production planning and control system (PPCS). A detailed definition of the FAS scheduling process is given and key differences between this process and the classical simple job shop scheduling process are discussed. A mathematical model is developed for the minimize makespan problem, and it is shown that the problem is NP-complete, that it is one the most difficult problems in the class of decision problems that can be solved by polynomial time nondeterministic algorithm (NP). The design of heuristic solution procedures is also discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
