A Greedy Biogeography-Based Optimization Algorithm for Job Shop Scheduling Problem with Time Lags

Abstract

This paper deals with the Job shop Scheduling problem with Time Lags (JSTL). JSTL is an extension of the job shop scheduling problem, where minimum and maximum time lags are introduced between successive operations of the same job. We propose a combination between Biogeography-Based Optimization (BBO) algorithm and Greedy heuristic for solving the JSTL problem with makespan minimization. Biogeography-Based optimization is an evolutionary algorithm which is inspired by the migration of species between habitats. BBO has successfully solved optimization problems in many different domains and has reached a relatively mature state using two main steps: migration and mutation. Good performances of the proposed combination between Greedy and BBO algorithms are shown through different comparisons on benchmarks of Fisher and Thompson, Lawrence and Carlier for JSTL problem.