Hybrid Non-dominated Sorting Simulated Annealing Algorithm for Flexible Job Shop Scheduling Problems

Shivasankaran, N.; Panneerselvam, Senthilkumar; Raja, K. Venkatesh

doi:10.1007/978-3-319-03107-1_12

Cited by 8 publications

(5 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Shivasankaran et al [52] proposed a new hybrid non-dominated sorting simulated annealing algorithm to solve a multi-objective FJSP. A flexible job shop scheduling problem with overlapping was also considered by Fattahi et al [23] where a mixed integer linear programming model was constructed and a SA was devised to evaluate the validity of the proposed SA algorithm.…”

Section: Flexible Job-shop Problemmentioning

confidence: 99%

Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate

Mokhtari

Dadgar

2015

Computers & Operations Research

View full text Add to dashboard Cite

Section: Flexible Job-shop Problemmentioning

confidence: 99%

Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate

Mokhtari

Dadgar

2015

Computers & Operations Research

View full text Add to dashboard Cite

“…The evaluation criteria of the MOFJSP are makespan, total machine work loading time and critical machine work loading time. Shivasankaran et al [164] proposed a new hybrid non-dominated sorting SA to solve the MOFJSP with the objectives of minimising makespan, critical machine workload, the total workload of the machines and total operating cost. The critical or incapable machine is eliminated by sorting all the nondominant operations, which effectively reduce the computational time complexity of the algorithm.…”

Section: Single Solution-based Meta-heuristicsmentioning

confidence: 99%

Review on flexible job shop scheduling

Xie

Gao

Peng

et al. 2019

IET Collaborative Intelligent Manufacturing

156

View full text Add to dashboard Cite

Flexible job shop scheduling problem (FJSP) is an NP‐hard combinatorial optimisation problem, which has significant applications in the real world. Due to its complexity and significance, lots of attentions have been paid to tackle this problem. In this study, the existing solution methods for the FJSP in recent literature are classified into exact algorithms, heuristics and meta‐heuristics, which are reviewed comprehensively. Moreover, the real‐world applications of the FJSP are also introduced. Finally, the development trends of the manufacturing industry are analysed, and the future research opportunities of the FJSP are summarised in detail.

show abstract

“…In this paper, we propose an integrated approach based on hybridizing sorting simulated annealing [19,20] algorithm and immune algorithm to solve flexible JSP. Sorting confines the initial search space by enhancing the convergence speed and immune simulated annealing algorithm provides the solution to converge quickly.…”

Section: Co-published By Atlantis Press and Taylor And Francis Copyrighmentioning

confidence: 99%

Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling

Shivasankaran¹,

Kumar²,

Raja³

2015

IJCIS

Self Cite

View full text Add to dashboard Cite

Hybrid sorting immune simulated annealing technique (HSISAT), a Meta -heuristic is proposed for solving the multi objective flexible job-shop scheduling problem (FJSP). The major objectives are distributing the time of machines among the set of operations and scheduling them to minimize the criterion (makespan, total workload and maximum workload). The processing time is sorted for isolating the critical machines and immune simulated annealing (ISA) is applied to increase the convergence speed. Several case studies have been taken from the literature to demonstrate the convergence speed of the proposed algorithm. The computational results have proved that the proposed hybrid algorithm is an effective approach to solve the multi-objective FJSP.

show abstract

Hybrid Non-dominated Sorting Simulated Annealing Algorithm for Flexible Job Shop Scheduling Problems

Cited by 8 publications

References 23 publications

Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate

Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate

Review on flexible job shop scheduling

Hybrid Sorting Immune Simulated Annealing Algorithm For Flexible Job Shop Scheduling

Contact Info

Product

Resources

About