FLOW-SHOP SCHEDULING WITH RESOURCE FLEXIBILITY

被引:58
作者
DANIELS, RL [1 ]
MAZZOLA, JB [1 ]
机构
[1] DUKE UNIV,FUQUA SCH BUSINESS,DURHAM,NC 27706
关键词
D O I
10.1287/opre.42.3.504
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper explores the improvements in manufacturing efficiency that can be achieved by broadening the scope of production scheduling to include both the sequencing of work and the coordination of the resource inputs required to perform work. Recognizing that some resources are inherently flexible and thus can be reassigned dynamically to processing centers as needed, and that job processing times are often a function of the amount of resource dedicated to specific operations, we formulate the flexible-resource scheduling problem with the objective of simultaneously determining the permutation job sequence, resource allocation policy, and operation start times that optimize system performance. Focusing on flexible-resource scheduling in flow shop production systems, we discuss problem complexity, identify properties of and establish lower bounds for optimal schedules, develop optimal and heuristic solution approaches, and report the results of extensive computational experimentation designed to explore the operational benefits of resource flexibility. The computational results demonstrate that the performance improvements associated with flexible-resource scheduling are substantial, and suggest that the heuristic provides an effective means for solving larger problems.
引用
收藏
页码:504 / 522
页数:19
相关论文
共 28 条
[1]  
Baker K., 1974, INTRO SEQUENCING SCH
[2]   COMPARATIVE STUDY OF FLOW-SHOP ALGORITHMS [J].
BAKER, KR .
OPERATIONS RESEARCH, 1975, 23 (01) :62-73
[3]  
Blackburn JD, 1991, TIME BASED COMPETITI
[4]  
Conway R, 1967, THEORY SCHEDULING
[5]   A MULTIOBJECTIVE APPROACH TO RESOURCE-ALLOCATION IN SINGLE-MACHINE SCHEDULING [J].
DANIELS, RL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1990, 48 (02) :226-241
[6]   SINGLE-MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND NUMBER OF JOBS TARDY [J].
DANIELS, RL ;
SARIN, RK .
OPERATIONS RESEARCH, 1989, 37 (06) :981-984
[7]   EVALUATION OF FLOW SHOP SEQUENCING HEURISTICS [J].
DANNENBRING, DG .
MANAGEMENT SCIENCE, 1977, 23 (11) :1174-1182
[8]   SIMULTANEOUS RESOURCE SCHEDULING TO MINIMIZE WEIGHTED FLOW TIMES [J].
DOBSON, G ;
KARMARKAR, US .
OPERATIONS RESEARCH, 1989, 37 (04) :592-600
[9]   A NEW INTEGER PROGRAMMING FORMULATION FOR THE PERMUTATION FLOWSHOP PROBLEM [J].
FRIEZE, AM ;
YADEGAR, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 40 (01) :90-98
[10]  
Garey M. R., 1975, SIAM Journal on Computing, V4, P397, DOI 10.1137/0204035