FLEXIBLE ASSEMBLY SYSTEMS - THE SCHEDULING PROBLEM FOR MULTIPLE PRODUCTS

作     者：DONATH, M GRAVES, RJ CARLSON, DA 

作者机构：Hoechst A.G. West Germany University of Massachusetts Amherst Massachusetts USA Supercomputing Research Center Lanham Maryland USA 

出 版 物：《JOURNAL OF MANUFACTURING SYSTEMS》 (J Manuf Syst)

年 卷 期：1989年第8卷第1期

页      面：27-34页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0802[工学-机械工程] 

主　　题：Scheduling Dispatching Complexity Analysis Algorithm Design Flexible Assembly Systems 

摘      要：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.