A rule-based estimation of distribution algorithm for solving job shop scheduling problems

被引：0

作者：

Zhang R. ^{[1
]}

机构：

[1] School of Economics and Management, Nanchang University

来源：

Journal of Convergence Information Technology | 2011年 / 6卷 / 08期

关键词：

Dispatching rules; Estimation of distribution algorithm; Job shop scheduling;

D O I：

10.4156/jcit.vol6.issue8.25

中图分类号：

学科分类号：

摘要：

In this paper, we aim at solving job shop scheduling problems with the total weighted tardiness objective. In order to save computational time, several effective dispatching rules are adopted for constructing feasible schedules. Meanwhile, it is noticeable that the rule selections for each machine are not mutually independent but actually interrelated. Under such circumstances, an estimation of distribution algorithm (EDA) is proposed to optimize the combination of the rules. The superiority of this approach is verified by extensive computational experiments and comparisons.

引用

页码：220 / 227

页数：7

共 23 条

[1]

Sun L., Cheng X., Liang Y., Solving job shop scheduling problem using genetic algorithm with penalty function, International Journal of Intelligent Information Processing, 1, 2, pp. 65-77, (2010)

[2]

Song C., Liu X., Wang W., Bai X., A hybrid particle swarm optimization algorithm for jobshop scheduling problem, International Journal of Advancements In Computing Technology, 3, 4, pp. 79-88, (2011)

[3]

Graham R.L., Lawler E.L., Lenstra J.K., Kan Rinnooy A.H.G., Optimisation and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 5, pp. 287-326, (1979)

[4]

Singer M., Pinedo M., A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops, IIE Transactions, 30, 2, pp. 109-118, (1998)

[5]

Vepsalainen A.P., Morton T.E., Priority rules for job shops with weighted tardy costs, Management Science, 33, 8, pp. 1035-1047, (1987)

[6]

Kutanoglu E., Sabuncuoglu I., An analysis of heuristics in a dynamic job shop with weighted tardiness objectives, International Journal of Production Research, 37, 1, pp. 165-187, (1999)

[7]

Pinedo M., Singer M., A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop, Naval Research Logistics, 46, 1, pp. 1-17, (1999)

[8]

Mason S.J., Fowler J.W., Carlyle W.M., A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops, Journal of Scheduling, 5, 3, pp. 247-262, (2002)

[9]

Monch L., Driessel R., A distributed shifting bottleneck heuristic for complex job shops, Computers & Industrial Engineering, 49, 3, pp. 363-380, (2005)

[10]

Kreipl S., A large step random walk for minimizing total weighted tardiness in a job shop, Journal of Scheduling, 3, 3, pp. 125-138, (2000)

← 1 2 3 →