A LAGRANGEAN RELAXATION ALGORITHM FOR THE 2 DUTY PERIOD SCHEDULING PROBLEM

被引:35
作者
SHEPARDSON, F [1 ]
MARSTEN, RE [1 ]
机构
[1] UNIV ARIZONA,TUCSON,AZ 85721
关键词
D O I
10.1287/mnsc.26.3.274
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:274 / 281
页数:8
相关论文
共 27 条
[1]   THE RELAXATION METHOD FOR LINEAR INEQUALITIES [J].
AGMON, S .
CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1954, 6 (03) :382-392
[2]   SCHEDULING A FULL-TIME WORKFORCE TO MEET CYCLIC STAFFING REQUIREMENTS [J].
BAKER, KR .
MANAGEMENT SCIENCE SERIES B-APPLICATION, 1974, 20 (12) :1561-1568
[3]  
BAKER KR, 1975, GSBA122 DUK U GRAD S
[4]   UNNETWORKS, WITH APPLICATIONS TO IDLE TIME SCHEDULING [J].
BARTHOLDI, JJ ;
RATLIFF, HD .
MANAGEMENT SCIENCE, 1978, 24 (08) :850-858
[5]  
BARTHOLDI JJ, 1977, 7711 U FLOR IND SYST
[6]   SCHEDULING OF WORK FORCES REQUIRED IN CONTINUOUS OPERATIONS UNDER ALTERNATIVE LABOR POLICIES [J].
BROWNELL, WS ;
LOWERRE, JM .
MANAGEMENT SCIENCE, 1976, 22 (05) :597-605
[7]   SHORTEST-ROUTE METHODS .1. REACHING, PRUNING, AND BUCKETS [J].
DENARDO, EV ;
FOX, BL .
OPERATIONS RESEARCH, 1979, 27 (01) :161-186
[8]  
FISHER ML, 1975, MATHEMATICAL PROGRAM, V3, P56
[9]  
Garfinkel R. S., 1972, INTEGER PROGRAMMING
[10]  
Geoffrion A., 1974, MATH PROGRAMMING STU, V2, DOI [10.1007/BFb0120690, DOI 10.1007/BFB0120686]