附录1 标准Job-shop Benchmark问题数据集最优解(续2)

JOB SHOP

Best lower and upper bounds known, from OR-Lib (27.10.97).
Update 27.1.99 including Brinkkoetter’s optimal solutions.
Update 30. 6. 99 including Schilham’s new upper bounds
Update 4.5.0 including Henning’s new upper bounds
Update 11.7.0 including Schilham’s new lower bounds
Update 27.9.01 including Nowicki and Smutnicki new upper bounds
Update 30.8.02 including Henning new upper bounds
Update 20.10.02 including Nowicki and Smutnicki new upper bounds
Update 10.3.03 including Caldeira new upper bound
Update 23.11.05 including Zhang new upper bounds
Update 29.10.09/23.11.09 including Nasiri and Kianfar new upper bounds
Update 10.09.2011 including Beck, Feng and Watson new upper bounds
Update 31.10.2011 including Gon鏰lves & Resende new upper bounds and Gharbi & Labidi new lower bounds
Update 17.06.2013 including Yuichi Nagata and Isao Ono new upper bounds

ta01-05 1231 | 1244 | 1218 | 1175 | 1224
15 x 15 Ta1 Ta1 | VA NS | B BV | B We | B B
ta06-10 1238 | 1227 | 1217 | 1274 | 1241

15 x 15 B B B B B BV B BV VA BV
ta11-15 1323-1357 1351-1367 1282-1342 1345 1304-1339
20 x 15 S BFW S BV S H2 VA NS S ZLGR
ta16-20 1304-1360 1462 1369-1396 1304-1332 1318-1348
20 x 15 GL H S NSc VA BV GL BFW S ZLGR
---------------------- ----------- ----------- ----------- ----------
ta21-25 1573-1642 1542-1600 1474-1557 1606-1644 1518-1595
20 x 20 GL BFW GL NSb GL NSb GL BFW GL NSd
ta26-30 1558-1643 1617-1680 1591-1603 1525-1625 1485-1584
20 x 20 GL BFW GL NSb VA ZLGR GL Aa GL NSb
---------------------- ----------- ----------- ----------- ----------
ta31-35 1764 1774-1785 1778-1791 1828-1829 2007
30 x 15 Ta1 AHLS Ta1 GR VA ZLGR Ta1 NSb VA Ta1
ta36-40 1819 1771 1673 1795 1631-1669
30 x 15 VA AHLS Ta1 ZLGR Ta1 H VA AHLS VA GR
---------------------- ----------- ----------- ----------- ----------
ta41-45 1876-2005 1867-1937 1809-1848 1927-1979 1997-2000
30 x 20 GL NO VA GR VA NK VA NO VA NSb
ta46-50 1940-2004 1789-1894 1912-1943 1915-1961 1807-1924
30 x 20 Ta1 GR VA GR VA GR VA NO VA BFW
---------------------- ----------- ----------- ----------- ----------
ta51-55 2760 2756 2717 2839 2679
50 x 15 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 NS
ta56-60 2781 2943 2885 2655 2723
50 x 15 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1
---------------------- ----------- ----------- ----------- ----------
ta61-65 2868 2869 2755 2702 2725
50 x 20 Ta1 NS VA JPC Ta1 NS BV NS Ta1 NS
ta66-70 2845 2825 2784 3071 2995
50 x 20 Ta1 NS VA AHLS BV NS Ta1 NS Ta1 NS
---------------------- ----------- ----------- ----------- ----------
ta71-75 5464 5181 5568 5339 5392
100 x 20 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1
ta76-80 5342 5436 5394 5358 5183
100 x 20 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 Ta1 NS

Aa:
E. Aarts (1996),
Personal communication.
(a parallel taboo search algorithm)

AHLS:
E. Aarts, Huub ten Eikelder, J.K. Lenstra, R. Schilham (23.6.1999)
Personnal communication.
(An adaptive memory programme embedding a taboo search algorithm with
NS neighbourhood and constant time Ta )

B:
Wolfgang Brinkkoetter (27.1.1999),
Personal communication.
(The method combines ideas of Carlier and Pinson with an
efficient way of propagating release/queue-time adjustments
in a simulation of parallel preemptive machines.
The method is described in:
Wolfgang Brinkkoetter (1997),
Erzeugung hochwertiger Loesungen fuer das Job Shop Scheduling Problem
mit Schwerpunkt auf dem Qualitaetsnachweis,
University of Paderborn, Paderborn, Germany).
c.f. also:
W. Brinkkoetter, P. Brucker
Solving open benchmarks problems for the job shop problem,
(1999)

BFW:
J. Christopher Beck, T. K. Feng, Jean-Paul Watson
Combining Constraint Programming and Local Search for Job-Shop Scheduling
INFORMS Journal on Computing 23(1): 1-14 (2011)

BV:
E. Balas, A. Vazacopoulos (1995),
Guided local search with shifting bottleneck for job shop scheduling,
Management Science Research Report #MSRR-609® [revised version],
Graduate School of Industrial Administration, Carnegie-Mellon University,
Pittsburgh, Pennsylvania.

BV’:
E. Balas, A. Vazacopoulos (1996),
Personal communication.

GL:
A. Gharbi, L. Labidi (6.6.2011)
Personal communication. Results obtained with method desribed in:
Anis Gharbi, Mohamed Labidi (2010),
“Extending the single machine-based relaxation scheme for the job shop scheduling problem”,
Electronic Notes in Discrete Mathematics, Volume 36, pp. 1057?064.

GR:
JOS?FERNANDO GON茿LVES AND MAURICIO G. C. RESENDE (2011)
A BIASED RANDOM-KEY GENETIC ALGORITHM FOR JOB-SHOP SCHEDULING
AT&T Labs Research Techhnical Report.

H:
Andre Henning (2000)
Private communication (5.4.0)
(Interactive method including various local searches and parameters)

H2:
Andr?Henning (2002)
Practical job shop scheduling problems (in german)(to be submitted)
Department of Mathematics and Computer Science
Friedrich-Schiller-University Jena
07740 Jena, Germany

JPC: Jo鉶 Paulo Caldeira (2003)
Private communication, 30.1.2003
Private communication, 10.3.2003
(hybrid evolutionary-tabu algorithm)

NK:
Nasiri and Kianfar (2009)
A pseudo杙ath relinking algorithm for the job shop problem
Private communications, 28.20.2009/23.11.2009

NO:
Yuichi Nagata and Isao Ono (2013)
Guided Constructive Local Search for the Job Shop Scheduling Problem
Technical report submitted for publication
27.02.2013

NS:
E. Nowicki, C. Smutnicki (1993),
A fast taboo search algorithm for the job shop problem,
Preprinty nr 8/93,
Institute of Engineering Cybernetics, Technical University of Wroclaw,
Wroclaw, Poland.

NSb:
E.Nowicki, C.Smutnicki, (2001)
New Ideas in TS for Job Shop Scheduling
Preprinty nr 50/2001
Institute of Engineering Cybernetics, Technical University of Wroclaw,
Wroclaw, Poland.
(A method that combines path relinking with NS’s fast taboo search)

NSc: Same method as NSb, Personal communication (7.5.2002)

NSd:
E.Nowicki, C.Smutnicki, (2002)
“Some New Tools to Solve the Job Shop Problem”
Technical Report 60/2002, Institute of Engineering Cybernetics, Technical University of Wroclaw,
Wroclaw, Poland.

S: R. Schilham (11.7.2000)
Personnal communication. (see below)

Ta1:
E. D. Taillard, (1994)
Parallel taboo search techniques for the job shop scheduling problem,
ORSA Journal on Computing 6, 108 ?117.
Results also reported in:
E. D. Taillard (1993),
Benchmarks for basic scheduling problems,
EJOR 64, 278-285.

VA:
R.J.M. Vaessens (1995),
Personal communication.
(lower bounds found using Applegate & Cook’s algorithm `edge-finder’)

VAAa:
R.J.M. Vaessens (1996),
Personal communication.
(upper bounds found using Applegate & Cook’s algorithm `shuffle’ with
initial solutions of B. Aarts (1996))

VABV:
R.J.M. Vaessens (1996),
Personal communication.
(upper bounds found using Applegate & Cook’s algorithm `shuffle’ with
initial solutions of E. Balas and A. Vazacopoulos (1995))

VAWe:
R.J.M. Vaessens (1995),
Personal communication.
(upper bounds found using Applegate & Cook’s algorithm `shuffle’ with
initial solutions of M. Wennink (1995))

We:
M. Wennink (1995),
Personal communication.
(upper bounds found by a taboo search algorithm)

WHW
Jean-Paul Watson, Adele E. Howeb and L. Darrell Whitley
Deconstructing Nowicki and Smutnicki’s i-TSAB tabu search algorithm for the job-shop scheduling problem
Volume 33, Issue 9, September 2006, Pages 2623-2644

ZLGR:
ChaoYong Zhang, PeiGen Li, ZaiLin Guan, YunQing Rao (2005)
A Tabu Search Algorithm with a New Neighborhood Structure for the Job Shop Scheduling Problem
and
A Very Fast TS/SA Algorithm for the Job Shop Scheduling Problem
School of Mechanical Science & Engineering, Huazhong University of Science & Technology,
Wuhan, 430074, P.R. China

NK - Nasiri and Kianfar, private communication, 28.20.2009
Tai_20_15_1
1358
13 8 2 11 7 6 12 14 3 17 5 10 15 1 9 4 20 19 16 18
8 10 7 4 11 5 6 14 12 13 2 9 1 19 15 17 20 16 3 18
12 7 8 18 3 5 19 9 16 4 13 6 11 1 14 2 15 17 20 10
11 15 6 12 4 14 17 1 2 19 13 10 8 3 18 7 9 5 16 20
9 8 10 4 14 12 2 13 16 11 5 7 1 3 19 17 20 15 18 6
16 9 20 2 12 15 6 8 5 4 14 3 7 19 17 11 10 1 18 13
12 20 16 15 9 6 13 7 18 11 5 8 14 2 19 10 17 1 4 3
12 13 8 9 17 7 6 11 4 2 1 3 15 18 14 10 16 5 19 20
4 5 18 12 13 7 16 2 11 6 17 8 19 10 3 9 20 14 15 1
9 20 14 11 13 5 4 12 16 15 3 18 8 7 6 2 19 17 1 10
18 7 11 4 20 9 6 13 5 17 10 12 14 1 2 3 8 15 19 16
20 18 1 8 6 16 13 4 12 17 10 7 5 11 3 19 2 9 14 15
14 7 13 16 19 5 8 2 9 3 11 6 15 1 17 12 10 20 18 4
4 8 20 18 15 19 7 6 12 13 5 10 9 17 16 14 2 11 3 1
5 20 16 13 15 12 4 1 7 11 18 3 17 2 10 8 19 6 14 9

Tai30_20_1
2010
10 22 28 6 9 24 11 12 4 17 2 20 14 25 19 18 16 29 3 26 23 30 7 21 1 27 15 5 13 8
6 11 23 26 19 15 27 2 10 13 18 30 14 16 17 5 9 12 22 3 25 7 21 8 20 24 4 28 1 29
7 10 2 21 5 27 13 6 12 3 9 22 17 30 14 18 16 8 23 19 25 1 26 24 28 20 4 29 15 11
7 9 10 18 14 22 16 2 30 19 12 13 1 4 8 29 5 3 21 24 6 28 15 20 26 27 17 25 11 23
16 15 23 11 2 14 20 13 8 6 10 5 29 27 17 3 4 19 30 1 9 12 22 25 24 21 26 28 7 18
1 12 23 13 24 3 2 18 6 16 17 27 19 15 10 5 22 20 30 26 4 25 14 21 28 9 7 8 29 11
12 5 25 18 23 21 22 2 20 30 13 10 6 19 1 15 9 4 29 16 3 26 8 11 17 14 24 28 27 7
22 21 9 20 18 2 27 12 23 6 19 17 4 26 5 25 30 3 1 8 15 29 10 13 24 28 14 7 11 16
5 3 20 15 4 10 28 2 14 16 23 6 12 22 17 29 8 7 27 1 25 11 21 26 30 18 19 13 9 24
19 16 18 12 10 23 2 14 27 15 28 29 30 5 20 22 26 1 7 24 25 21 8 11 4 13 6 17 9 3
9 23 6 14 17 12 26 27 8 11 15 19 7 10 22 13 2 25 1 24 20 5 16 28 4 3 29 18 21 30
25 19 13 29 15 27 23 5 4 24 12 16 17 9 14 30 8 20 3 11 22 28 6 7 1 18 26 21 2 10
8 22 2 23 26 10 6 17 5 12 28 21 7 14 18 1 16 20 13 15 30 3 24 25 9 29 11 27 19 4
2 6 26 18 13 4 20 5 17 19 1 23 10 12 7 27 22 15 8 11 29 28 24 9 16 25 14 30 3 21
9 15 24 27 25 13 2 17 18 29 16 3 4 21 12 23 6 1 8 11 7 19 20 26 30 14 5 22 10 28
2 15 13 16 5 27 18 7 6 1 10 11 14 28 24 22 17 19 29 8 20 30 3 23 4 25 12 9 21 26
30 22 7 21 5 25 18 27 10 16 6 19 15 17 20 29 28 9 12 11 3 26 1 14 8 13 2 23 24 4
21 20 17 19 18 9 7 16 14 8 6 15 3 25 28 5 23 12 2 10 22 24 26 1 11 13 4 29 27 30
26 23 16 29 25 28 17 3 6 18 30 22 2 20 15 14 4 19 9 7 21 13 8 24 27 5 12 11 1 10
18 13 16 27 17 9 22 6 2 14 10 5 1 12 7 28 8 24 15 11 4 25 20 23 19 21 3 30 29 26

Tai30_20_2
1945
13 9 25 15 22 5 19 8 16 27 12 1 14 21 20 11 29 26 18 17 3 23 28 10 6 30 24 4 2 7
15 5 10 2 21 24 4 22 8 7 27 29 3 19 28 17 1 25 12 14 6 18 20 30 26 13 16 9 23 11
13 16 2 18 7 4 15 5 14 26 25 9 21 22 24 6 29 8 12 27 28 1 11 19 17 3 10 20 23 30
25 5 26 7 1 2 29 16 10 15 12 17 28 11 14 6 30 21 27 22 19 18 23 9 4 20 3 24 8 13
1 7 29 26 14 25 24 23 17 16 19 9 6 20 22 12 8 4 11 13 10 27 21 18 15 3 28 2 30 5
12 13 1 29 25 21 11 26 30 27 9 17 14 6 24 28 22 2 3 10 19 23 8 16 15 18 7 4 5 20
2 12 26 18 23 15 10 25 1 17 8 24 29 19 5 14 6 22 11 7 3 30 21 27 4 16 13 20 28 9
23 4 5 26 17 9 7 8 21 19 15 2 11 13 22 18 20 29 27 1 16 25 30 14 12 6 10 24 3 28
21 26 29 17 14 1 3 30 22 25 20 6 11 19 7 27 28 4 18 23 10 16 15 12 13 8 9 24 5 2
24 10 12 16 9 15 25 13 26 29 17 6 19 21 20 22 4 30 7 3 28 27 1 11 23 5 2 14 8 18
5 14 1 25 11 8 22 27 2 15 19 10 3 20 7 29 26 17 13 12 23 18 24 21 28 9 30 16 6 4
29 10 19 30 2 21 25 24 17 11 27 1 26 20 9 5 8 22 7 13 6 14 16 12 28 15 18 4 3 23
25 14 1 10 2 12 17 16 24 27 5 29 21 30 6 20 22 8 7 28 9 3 19 15 23 18 11 26 13 4
26 7 18 2 22 29 11 14 17 28 27 10 16 25 3 1 15 5 30 19 9 21 20 6 4 12 24 23 13 8
25 11 16 30 18 2 12 22 24 29 23 15 10 3 28 19 9 1 17 4 7 14 8 13 26 6 27 20 5 21
19 7 3 15 25 22 1 12 14 28 23 21 8 24 30 16 17 2 4 13 29 27 10 5 11 18 9 6 20 26
30 15 22 10 28 16 21 24 3 8 14 5 7 11 4 26 1 2 20 18 25 12 23 6 27 19 17 29 13 9
7 9 17 3 5 15 12 20 14 24 8 21 29 22 23 4 30 16 25 1 2 28 6 27 13 10 26 19 18 11
12 11 13 29 17 5 8 15 22 18 26 25 2 9 19 6 1 30 20 16 10 14 4 3 7 28 24 23 27 21
11 19 7 15 13 17 21 28 26 1 14 30 2 22 16 12 29 27 23 6 10 20 9 18 3 4 5 8 25 24

Tai30_20_6
2014
30 7 15 19 14 12 18 20 13 29 9 24 23 22 28 6 16 2 25 17 5 8 21 10 1 26 11 4 27 3
11 15 23 16 26 28 5 19 4 12 1 27 13 8 24 7 18 14 25 2 22 6 3 29 10 20 21 30 17 9
14 12 18 5 22 27 20 17 11 15 25 4 28 16 13 30 7 29 19 24 10 23 9 26 21 8 1 2 3 6
5 20 16 18 8 13 30 19 27 10 4 12 24 14 15 28 21 6 9 3 2 17 23 1 11 25 7 29 26 22
19 23 18 14 16 30 8 12 26 22 5 7 27 15 4 24 9 10 25 17 21 11 28 29 13 2 3 1 6 20
18 15 7 16 19 8 13 9 29 12 20 24 10 2 23 5 25 30 22 17 11 14 21 3 1 26 27 4 6 28
13 14 29 24 19 26 20 6 11 28 7 8 15 27 25 2 9 23 17 12 3 10 30 18 5 16 4 22 1 21
30 15 12 19 1 18 6 26 16 22 14 11 8 7 20 29 17 5 10 24 3 21 28 2 9 13 27 25 23 4
30 19 7 5 26 15 27 9 13 12 18 23 2 28 10 25 20 6 29 14 1 24 16 22 8 21 3 4 11 17
15 19 7 26 25 10 22 4 6 13 30 20 8 18 29 24 28 9 12 14 27 3 16 5 17 11 23 1 2 21
7 2 16 1 18 5 20 11 9 14 26 15 24 4 12 23 8 19 3 29 28 6 17 21 10 30 22 27 13 25
12 16 6 15 24 13 1 25 18 4 9 2 11 8 30 27 5 19 17 28 22 21 23 26 3 14 7 10 20 29
23 1 14 9 8 7 19 15 10 26 13 17 20 18 28 30 5 11 12 25 27 6 4 21 3 22 29 24 16 2
24 19 21 4 25 16 13 7 29 8 28 20 6 26 10 15 11 30 17 12 9 5 22 2 27 18 23 3 1 14
16 29 25 20 1 12 8 18 4 13 27 11 23 7 6 15 17 24 19 30 9 3 21 10 2 26 5 14 22 28
7 3 18 1 12 10 27 8 11 16 21 19 15 5 6 23 2 25 30 28 24 17 22 14 9 13 26 29 20 4
20 14 21 26 29 24 19 18 2 8 10 15 12 6 11 9 17 5 27 3 23 22 28 7 16 4 25 30 13 1
29 21 12 14 19 22 28 1 24 18 11 7 9 25 16 26 27 17 8 10 23 30 2 5 3 4 6 20 13 15
23 26 11 7 29 4 6 30 8 15 13 22 24 10 14 19 25 16 12 20 1 2 27 3 28 17 21 18 5 9
30 12 1 6 8 7 11 28 27 9 18 23 15 4 24 13 29 19 10 3 2 22 17 16 20 25 14 26 5 21

Tai30_20_7
1899
16 12 20 9 24 27 26 2 29 25 5 15 3 8 19 17 21 13 14 30 4 1 22 11 10 28 7 18 6 23
17 18 8 29 9 19 15 24 16 27 2 4 3 26 1 7 5 28 11 30 13 14 23 12 20 21 10 25 22 6
4 21 7 29 28 9 24 19 5 3 23 10 17 27 22 2 13 15 1 12 20 25 6 26 30 11 18 8 14 16
13 18 29 16 14 12 25 3 30 19 5 10 9 8 27 11 17 2 26 6 15 21 23 22 1 7 4 28 24 20
28 15 13 16 24 7 2 19 27 9 5 8 22 12 26 4 29 21 6 3 17 14 25 18 23 11 10 1 30 20
14 6 29 25 8 23 13 20 17 19 12 2 24 7 4 27 26 30 16 9 10 3 21 22 18 5 1 15 28 11
29 25 4 8 10 14 13 6 22 9 7 5 19 21 2 11 30 18 24 20 1 26 23 17 28 16 3 12 15 27
15 8 13 19 1 18 28 21 11 16 25 17 7 14 12 24 22 30 5 27 6 20 10 3 4 2 23 26 9 29
5 22 7 15 19 2 13 16 24 27 8 14 6 25 10 18 1 12 29 9 4 17 28 21 23 3 26 20 30 11
22 26 20 21 19 7 29 16 6 13 5 3 4 11 8 18 25 28 30 10 15 9 23 17 14 27 12 2 24 1
30 19 15 3 5 25 24 14 16 6 12 11 8 17 10 29 2 13 1 28 26 23 4 18 20 22 7 21 9 27
19 1 17 15 12 16 11 25 30 3 26 10 4 2 7 5 8 20 29 9 6 13 27 28 23 21 22 24 14 18
11 14 9 18 19 15 8 4 29 1 13 3 17 2 5 6 26 30 21 27 20 22 16 10 25 24 28 7 23 12
21 20 15 28 10 16 6 14 4 13 3 24 19 2 29 12 7 8 18 5 17 1 23 26 22 30 27 25 9 11
21 14 16 3 4 29 9 26 8 20 10 24 22 5 11 6 13 30 7 12 27 1 15 2 18 23 17 28 19 25
4 19 16 18 28 13 15 12 20 29 8 21 27 14 6 25 5 24 2 22 10 30 11 1 23 26 3 17 9 7
22 8 21 15 1 5 27 10 6 9 16 23 4 19 29 18 24 3 28 2 20 17 25 14 12 30 7 13 26 11
5 22 16 27 28 10 29 4 17 30 2 11 13 19 14 20 15 9 21 8 26 24 25 12 6 3 7 1 18 23
26 11 29 12 15 27 17 10 24 21 8 22 3 14 13 4 19 16 1 2 30 6 7 5 28 18 23 25 20 9
17 3 1 7 4 19 5 21 29 2 10 15 6 22 23 9 24 26 11 27 12 18 8 13 25 30 20 16 14 28

NK - Nasiri and Kianfar, private communication, 23.11.2009
tai30_15_2
1790
1 19 13 11 23 4 12 17 7 28 5 14 2 25 29 20 27 6 18 30 9 8 10 24 21 15 26 3 16 22
16 24 5 4 11 26 18 7 19 8 3 1 21 27 15 12 28 2 17 30 10 25 23 29 13 22 20 14 6 9
27 16 25 1 7 15 17 5 28 12 29 13 8 4 14 22 18 23 19 11 24 3 20 2 30 10 9 6 21 26
19 15 7 27 5 8 28 12 21 2 10 29 4 3 18 30 25 6 26 9 13 11 22 20 24 14 1 23 16 17
28 10 20 6 7 4 19 29 1 8 15 5 12 16 17 13 14 2 27 3 26 23 25 11 22 9 30 21 18 24
19 20 7 14 5 10 16 11 6 8 15 17 29 1 27 25 12 4 3 30 22 13 9 23 24 26 28 18 21 2
10 23 16 30 20 19 15 1 17 11 22 28 9 5 4 14 8 18 21 29 3 26 2 25 6 24 12 27 13 7
8 5 16 23 20 19 2 4 14 7 15 30 27 26 13 28 24 11 17 10 29 12 22 6 18 9 3 25 21 1
23 7 14 18 1 5 22 26 16 28 17 30 27 13 2 4 29 20 25 24 19 10 9 15 21 8 3 6 11 12
15 18 7 29 19 8 16 24 13 28 14 23 22 17 20 1 25 21 10 5 6 11 12 4 2 9 30 27 3 26
20 21 1 19 15 14 27 16 3 9 8 12 18 17 23 5 26 6 30 2 4 29 22 25 28 11 24 10 13 7
23 6 20 13 30 17 11 15 7 16 12 1 21 28 3 5 4 27 18 10 14 2 8 19 29 25 26 22 9 24
19 12 3 7 4 1 29 22 5 27 13 24 11 8 2 14 10 23 15 21 20 9 30 25 28 6 26 17 18 16
1 4 19 17 12 14 27 11 7 22 5 25 23 3 2 13 21 30 29 9 8 10 24 28 15 26 6 18 20 16
28 4 8 27 22 7 6 14 19 3 21 1 9 16 26 30 2 10 5 23 12 25 15 13 24 29 17 18 11 20

tai30_15_10
1673
26 23 19 20 22 7 28 12 30 13 18 9 11 3 29 17 27 4 24 25 6 21 10 15 16 5 14 1 2 8
10 24 18 22 16 20 21 1 4 12 28 14 6 29 25 2 11 19 23 15 8 9 30 7 27 5 3 26 13 17
7 17 18 28 9 12 6 29 13 27 30 3 19 23 11 5 10 2 20 22 16 8 24 1 14 15 25 26 4 21
14 25 7 19 29 26 28 21 30 18 11 13 12 16 17 3 1 27 15 22 23 4 9 20 24 10 6 8 5 2
11 27 6 25 18 14 22 21 30 2 24 16 23 17 1 28 19 13 7 9 10 29 20 5 8 4 3 12 15 26
25 12 30 24 5 8 1 17 23 28 6 11 14 16 4 7 27 15 20 21 2 9 13 19 29 3 18 22 10 26
10 11 17 13 8 7 23 29 1 26 9 16 15 3 6 12 14 27 28 24 30 20 21 19 18 2 5 4 25 22
19 11 24 27 10 14 12 21 5 22 7 17 16 28 9 18 25 23 30 1 4 29 13 8 3 26 2 15 6 20
27 25 2 8 21 23 19 11 29 14 5 24 6 18 28 9 17 16 30 4 3 12 20 7 22 10 26 15 1 13
3 12 18 21 23 25 1 29 11 9 30 2 28 22 8 20 6 5 27 24 14 10 7 13 26 15 17 4 16 19
16 22 30 21 29 5 10 14 9 11 13 6 17 12 15 3 25 23 19 24 8 2 1 20 26 27 18 28 4 7
2 21 6 23 30 11 1 18 29 20 16 7 27 28 13 24 15 3 12 4 10 22 14 5 25 9 8 17 19 26
21 28 24 14 13 4 5 12 6 26 25 18 27 11 30 23 2 7 3 15 22 1 20 19 17 16 29 9 8 10
9 18 16 12 21 11 24 29 25 22 28 17 27 4 3 23 30 1 15 20 7 19 5 10 2 14 6 13 26 8
18 8 27 26 21 10 6 22 12 23 7 28 17 20 11 16 4 5 9 3 13 24 30 14 1 15 29 19 2 25

tai30_20_1
2006
10 22 28 6 9 24 11 12 4 17 2 20 25 14 18 19 16 29 3 26 23 30 7 21 1 27 15 5 13 8
6 11 23 26 19 15 27 2 18 13 10 30 16 14 17 5 22 12 9 3 25 21 7 8 1 24 4 28 20 29
7 10 2 21 5 27 13 6 12 9 3 17 22 30 18 14 16 8 25 23 1 26 28 24 20 4 19 29 15 11
7 9 10 18 14 22 16 2 30 19 12 13 8 1 4 29 5 3 21 6 24 28 15 20 26 27 25 17 11 23
16 15 23 11 2 14 20 13 8 6 5 10 29 27 17 3 30 4 1 9 22 12 25 21 24 19 26 28 7 18
12 23 13 1 24 3 2 18 6 16 17 27 19 15 5 22 20 30 26 10 4 25 14 21 28 7 9 8 29 11
12 5 25 18 23 21 22 2 20 30 13 10 6 19 1 15 9 29 4 16 3 26 8 11 14 24 17 28 27 7
22 21 9 20 18 2 27 12 23 6 19 17 4 26 5 25 30 3 1 8 15 29 10 13 24 28 7 14 11 16
5 3 20 15 4 10 28 2 14 16 23 6 12 22 17 29 7 8 1 27 25 11 21 26 30 18 13 19 9 24
19 16 18

  • 3
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值