Discrepancy search for the flexible job shop scheduling problem

  • Authors:

  • Abir Ben Hmida;Mohamed Haouari;Marie-José/ Huguet;Pierre Lopez

  • Affiliations:

  • CNRS/ LAAS/ 7 avenue du colonel Roche, F-31077 Toulouse, France and Université/ de Toulouse/ UPS, INSA, INP, ISAE/ LAAS/ F-31077 Toulouse, France and Combinatorial Optimization Research Group ...;Department of Industrial Engineering, Ozyegin University, Istanbul, Turkey and Princess Fatimah Alnijris Research Chair for AMT, College of Engineering, King Saud University, Riyadh, Saudi Arabia;CNRS/ LAAS/ 7 avenue du colonel Roche, F-31077 Toulouse, France and Université/ de Toulouse/ UPS, INSA, INP, ISAE/ LAAS/ F-31077 Toulouse, France;CNRS/ LAAS/ 7 avenue du colonel Roche, F-31077 Toulouse, France and Université/ de Toulouse/ UPS, INSA, INP, ISAE/ LAAS/ F-31077 Toulouse, France

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine, so that the resulting schedule has a minimal completion time. We propose a variant of the climbing discrepancy search approach for solving this problem. We also present various neighborhood structures related to assignment and sequencing problems. We report the results of extensive computational experiments carried out on well-known benchmarks for flexible job shop scheduling. The results demonstrate that the proposed approach outperforms the best-known algorithms for the FJSP on some types of benchmarks and remains comparable with them on other ones.