Minimising the total cost of tardiness and overtime in a resumable capacitated job shop scheduling problem by using an efficient hybrid algorithm

被引：0

作者：

Rohaninejad M. ^{[1
]}

Sahraeian R. ^{[1
]}

Nouri B.V. ^{[2
]}

机构：

[1] Department of Industrial Engineering, College of Engineering, Shahed University, Tehran

[2] Department of Industrial Engineering, College of Engineering, Bu-Ali Sina University, Hamadan

来源：

International Journal of Industrial and Systems Engineering | 2017年 / 26卷 / 03期

关键词：

Capacitated job shop scheduling; Firefly algorithm; Genetic algorithm; Industrial and systems engineering; Shifting procedure; Taguchi method;

D O I：

10.1504/IJISE.2017.084421

中图分类号：

学科分类号：

摘要：

This paper investigates a resumable capacitated job shop scheduling problem (CJSSP) that can have considerable applications in heavy industries where the job processing times are prolonged. Hence, this type of scheduling is somewhat classified as medium and long-term scheduling problem, in which the limited capacity of machineries cannot be overlooked. In order to formulate the problem a new mixed-integer linear programming (MILP) model with the objective of minimising the total cost of tardiness and overtime is presented. Since the problem is a Non-deterministic Polynomial-time hard (NP-Hard) problem, an effective hybrid meta-heuristic based on the genetic and firefly algorithms are developed to tackle its complexity in a reasonable time. In addition, two heuristic algorithms rooted in the shifting and Lagrangean procedures are proposed to guide the search process toward the feasible points of a given problem. For the sake of obtaining better and more robust solutions, the Taguchi method is also used to calibrate the parameters of the algorithm. Furthermore, numerical experiments are provided for evaluating the performance and effectiveness of the solution method. Regarding to the computational result, the efficiency of the proposed hybrid metaheuristic is evident, especially on solving medium and large-sized problems. Copyright © 2017 Inderscience Enterprises Ltd.

引用

页码：318 / 343

页数：25

共 35 条

[21]

Sayadi M., Ramezanian R., Ghaffari-Nasab N., A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems, International Journal of Industrial Engineering Computations, 1, 1, pp. 1-10, (2010)

[22]

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)

[23]

Tavakkoli-Moghaddam R., Khalili M., Naderi B., A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness, Soft Computing, 13, 10, pp. 995-1006, (2009)

[24]

Vahedi-Nouri B., Fattahi P., Ramezanian R., Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints, Journal of Manufacturing Systems, 32, 1, pp. 167-173, (2013)

[25]

Vahedi-Nouri B., Fattahi P., Rohaninejad M., Tavakkoli-Moghaddam R., Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints, Applied Mathematical Modelling, 37, 5, pp. 3126-3137, (2013)

[26]

Vahedi-Nouri B., Fattahi P., Ramezanian R., Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities, International Journal of Production Research, 51, 12, pp. 3501-3515, (2013)

[27]

Vahedi-Nouri B., Fattahi P., Tavakkoli-Moghaddam R., Ramezanian R., A general flow shop scheduling problem with consideration of position-based learning effect and multiple availability constraints, The International Journal of Advanced Manufacturing Technology, 73, 5-8, pp. 601-611, (2014)

[28]

Wang S., ACO-based method for single machine scheduling with sequence-dependent setup time and limited capacity warehouse, International Journal of Industrial and Systems Engineering, 16, 3, pp. 334-364, (2014)

[29]

Watanabe M., Ida K., Gen M., A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem, Computers & Industrial Engineering, 48, 4, pp. 743-752, (2005)

[30]

Wu C.J., Hamada M.S., Experiments: Planning, Analysis, and Optimization, (2011)

← 1 2 3 4 →