An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method

31Citations
Citations of this article
46Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, then the FJSP comes under integrated approach. Otherwise, it becomes a hierarchical approach. Very less research has been done in the past on FJSP problem as it is an NP-hard (non-deterministic polynomial time hard) problem and very difficult to solve till date. Further, very less focus has been given to solve the FJSP using an integrated approach. So an attempt has been made to solve FJSP based on integrated approach using TLBO. Teaching–learning-based optimization is a meta-heuristic algorithm which does not have any algorithm-specific parameters that are to be tuned in comparison to other meta-heuristics. Therefore, it can be considered as an efficient algorithm. As best student of the class is considered as teacher, after few iterations all the students learn and reach the same knowledge level, due to which there is a loss in diversity in the population. So, like many meta-heuristics, TLBO also has a tendency to get trapped at the local optimum. To avoid this limitation, a new local search technique followed by a mutation strategy (from genetic algorithm) is incorporated to TLBO to improve the quality of the solution and to maintain diversity, respectively, in the population. Tests have been carried out on all Kacem’s instances and Brandimarte's data instances to calculate makespan. Results show that TLBO outperformed many other algorithms and can be a competitive method for solving the FJSP.

References Powered by Scopus

Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems

4172Citations
N/AReaders
Get full text

COMPLEXITY OF FLOWSHOP AND JOBSHOP SCHEDULING.

2369Citations
N/AReaders
Get full text

Scheduling: Theory, algorithms, and systems

2337Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Review on flexible job shop scheduling

171Citations
N/AReaders
Get full text

Real-time integrated production-scheduling and maintenance-planning in a flexible job shop with machine deterioration and condition-based maintenance

82Citations
N/AReaders
Get full text

Solving the flexible job shop scheduling problem using an improved Jaya algorithm

79Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Buddala, R., & Mahapatra, S. S. (2019). An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method. Journal of Industrial Engineering International, 15(1), 181–192. https://doi.org/10.1007/s40092-018-0280-8

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 13

54%

Lecturer / Post doc 5

21%

Professor / Associate Prof. 3

13%

Researcher 3

13%

Readers' Discipline

Tooltip

Computer Science 9

45%

Engineering 7

35%

Social Sciences 2

10%

Business, Management and Accounting 2

10%

Save time finding and organizing research with Mendeley

Sign up for free