Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm

被引：33

作者：

Keesari H.S. ^{[1
]}

Rao R.V. ^{[1
]}

机构：

[1] Department of Mechanical Engineering, S. V. National Institute of Technology, Surat, 395007, Gujarat

来源：

OPSEARCH | 2014年 / 51卷 / 4期

关键词：

Benchmark problems; Job shop scheduling; Teaching-learning-based optimization;

D O I：

10.1007/s12597-013-0159-9

中图分类号：

学科分类号：

摘要：

A job shop scheduling problem is one of the most difficult NP hard combinatorial optimization problems. In a job shop scheduling problem (JSSP), there are n jobs that should be processed on m machines. Each job consists of a predetermined sequence of task operations, each of which needs to be processed without interruption for a given period of time on a given machine. Tasks of the same job cannot be processed concurrently. In recent years, optimization algorithms such as simulated annealing (SA), genetic algorithm (GA), tabu search (TS), ant colony optimization (ACO) particle swarm optimization (PSO) and artificial bee colony (ABC) have played a significant role in solving small-scale job shop scheduling problems. However, when the problem size grows, metaheuristic algorithms usually take excessive time to converge. In this study, a recently developed Teaching-Learning-Based Optimization (TLBO) method is proposed to solve the job shop scheduling problems to minimize the makespan. The proposed algorithm is tested on 58 job shop scheduling bench mark problems from OR Library and results are compared with the results obtained by using the other algorithms. It is concluded that the TLBO algorithm can be effectively used for job shop scheduling problems. © Operational Research Society of India 2013.

引用

页码：545 / 561

页数：16

共 35 条

[1]

Zhou H., Feng Y., Han L., The hybrid heuristic genetic algorithm for job shop scheduling, Comput. Ind. Eng, 40, pp. 191-200, (2011)

[2]

Sha D.Y., Cheng-Yu H., A hybrid particle swarm optimization for job shop scheduling problem, Comput. Ind. Eng, 51, pp. 791-808, (2006)

[3]

Guo Z.X., Wong W.K., Leung S.Y.S., Fan J.T., Chan S.F., Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: A case study based on the apparel industry, Comput. Ind. Eng, 50, pp. 202-219, (2006)

[4]

Seda M., Mathematical models of flow shop and job shop scheduling problems, World. Aca. Sci. Eng. Technol, 31, pp. 122-127, (2007)

[5]

Moghaddas R., Houshmand M., Job-shop scheduling problem with sequence dependent setup times, Multi. Conf. Eng. Comput. Sci, 2, pp. 19-21, (2008)

[6]

Mahavi M.M., Farzad Z., Farzad F.J., A fuzzy modeling for single machine scheduling problem with deteriorating jobs, Int. J. Ind. Eng. Comput, 1, pp. 147-156, (2010)

[7]

Kaschel J., Teich T., Kobernik G., Meier B., Algorithms for the job shop scheduling problem—a comparison of different methods. European Symposium on Intelligent Techniques, June 3–4, Outdoor Academy of Crete, Greece, (1998)

[8]

Zhigang L., Bin J., Xingsheng G., A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan, App. Math. Comput, 183, pp. 1008-1017, (2006)

[9]

Lin T.L., Shi J.H., Tzong W.K., Yuan H.C.R.J., Jui L.L., Kuo I.H., Run R.S., An efficient job-shop scheduling algorithm based on particle swarm optimization, Exp. Syst. Appl, 37, pp. 2629-2636, (2010)

[10]

Huang R.H., Multi-objective job-shop scheduling with lot-splitting production, Int. J. Prod. Eco, 124, pp. 206-213, (2010)

← 1 2 3 4 →