AN APPROACH FOR ALLOCATING MANUFACTURING RESOURCES TO PRODUCTION TASKS

被引:11
作者
CHRYSSOLOURIS, G
PIERCE, J
DICKE, K
机构
[1] MIT,MFG & PROD LAB,CAMBRIDGE,MA 02139
[2] MIT,INTERDEPT LAB MFG & PROD,PROGRAM INTELLIGENT MFG SYST,CAMBRIDGE,MA 02139
关键词
DECISION MAKING; MANUFACTURING SYSTEMS; ASSIGNMENT; MANUFACTURING RESOURCES; PRODUCTION TASKS; ARTIFICIAL INTELLIGENCE; OPERATIONS RESEARCH; FLEXIBILITY;
D O I
10.1016/0278-6125(91)90055-7
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper presents the concept of MAnufacturing DEcision MAking (MADEMA)-a multicriteria decision-making procedure for manufacturing systems. The concept is based on a hierarchical structure of the manufacturing system and calls for the execution of four consecutive steps to make decisions on the assignment of manufacturing resources to production tasks. MADEMA utilizes decision theory in tandem with randomized search methods and has been experimentally implemented on a software system written in LISP. Particular emphasis is given to its flexibility in terms of the decision-making criteria used and the tradeoff between system performance and computational effort. This flexibility permits adjustment of the procedure to suit the available computational environment and the required decision making time. This paper includes preliminary simulation results of applying MADEMA to a real life manufacturing workcenter.
引用
收藏
页码:368 / 382
页数:15
相关论文
共 20 条
[1]  
Chryssolouris, Wright, Cobb, Decision-Making Strategy for Manufacturing Systems, Proceedings of the IEEE International Conference on Cybernetics and Society, pp. 64-72, (1985)
[2]  
Graves, A Review of Production Scheduling, Operations Research, 29, 4, pp. 646-675, (1981)
[3]  
Gershwin, A Hierarchical Framework for Discrete Event Scheduling in Manufacturing Systems, Discrete Event Systems: Models and Applications, (1987)
[4]  
Eastman, Even, Isaacs, Bounds for the Optimal Scheduling of n Jobs on m Processors, Management Science, pp. 268-279, (1964)
[5]  
Buzacott, Yao, Flexible Manufacturing Systems: A Review of Analytical Models, Management Science, pp. 890-905, (1986)
[6]  
Federgruen, Groenevelt, Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques, Management Science, pp. 341-349, (1986)
[7]  
Sen, Raizadeh, Dileepan, A Branch and Bound Approach to the Bicreterion Scheduling Problem Involving Total Flowtime and a Range of Lateness, Management Science, 34, 2, pp. 254-260, (1988)
[8]  
Van Wassenhove, Baker, A Bicreterion Approach to Time/Cost Tradeoffs in Sequencing, European Journal of Operations Research, 11, pp. 48-54, (1982)
[9]  
Jatinder, Gupta, The Generalized n-Job, M-Machine Scheduling Problem, Operations Research, 8, 173, (1971)
[10]  
Morton, Lawrence, Rajagopolan, Kekre, SCHED-STAR A Price-Based Shop Scheduling Module, Manufacturing and Operations Management, 1, pp. 131-181, (1988)