A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem

Scheduling for the flexible job-shop is a very important issue in both fields of combinatorial optimization and production operations. However, due to combination of the routing and sequencing problems, flexible job-shop scheduling problem (FJSP) presents additional difficulty than the classical job-shop scheduling problem and requires more effective algorithms. This paper developed a filtered-beam-search-based heuristic algorithm (named as HFBS) to find sub-optimal schedules within a reasonable computational time for the FJSP with multiple objectives of minimising makespan, the total workload of machines and the workload of the most loaded machine. The proposed algorithm incorporates dispatching rules based heuristics and explores intelligently the search space to avoid useless paths, which makes it possible to improve the search speed. Through computational experiments, the performance of the presented algorithm is evaluated and compared with those of existing literature and those of commonly used dispatching rules, and the results demonstrate that the proposed algorithm is an effective and practical approach for the FJSP.

[1]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[2]  P. Ow,et al.  Filtered beam search in scheduling , 1988 .

[3]  Anita Lee,et al.  Flexible manufacturing system (FMS) scheduling using filtered beam search , 1990, J. Intell. Manuf..

[4]  Takashi Sekiguchi,et al.  A timed Petri net and beam search based online FMS scheduling system with routing flexibility , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[5]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[6]  H. M. Shih.  Fuzzy inference and beam search based scheduling , 1994, Proceedings of 1994 IEEE International Conference on Industrial Technology - ICIT '94.

[7]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[8]  Jiyin Liu,et al.  The classification of FMS scheduling problems , 1996 .

[9]  Mark A. Coffin,et al.  R&D project selection and scheduling with a filtered beam search approach , 1996 .

[10]  Semra Tunali.  Evaluation of alternate routing policies in scheduling a job-shop type FMS , 1997 .

[11]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[12]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

[13]  Ihsan Sabuncuoglu,et al.  A STUDY OF SCHEDULING RULES OF FLEXIBLE MANUFACTURING SYSTEMS : A SIMULATION APPROACH , 1998 .

[14]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[15]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

[16]  Nidhal Rezg,et al.  An integrated greedy heuristic for a flexible job shop scheduling problem , 2001, 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236).

[17]  John W. Fowler,et al.  Comparison of Multiple Objective Genetic Algorithms for Parallel Machine Scheduling Problems , 2001, EMO.

[18]  S. H. Wu,et al.  Concurrent process planning and scheduling in distributed virtual manufacturing , 2002 .

[19]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[20]  Rémy Dupas,et al.  Evaluation of mutation heuristics for solving a multiobjective flexible job shop by an evolutionary algorithm , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[21]  Adil Baykasoğlu,et al.  Linguistic-based meta-heuristic optimization model for flexible job shop scheduling , 2002 .

[22]  N.M. Najid,et al.  A modified simulated annealing method for flexible job shop scheduling problem , 2002, IEEE International Conference on Systems, Man and Cybernetics.

[23]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[24]  Thomas O. Boucher,et al.  An architecture for scheduling and control in flexible manufacturing systems using distributed objects , 2002, IEEE Trans. Robotics Autom..

[25]  V. Cristina Ivanescu,et al.  Makespan estimation and order acceptance in batch process industries when processing times are uncertain , 2002, OR Spectr..

[26]  Ihsan Sabuncuoglu,et al.  Reactive scheduling in a dynamic and stochastic FMS environment , 2003 .

[27]  Carlos A. Brizuela,et al.  Experimental Genetic Operators Analysis for the Multi-objective Permutation Flowshop , 2003, EMO.

[28]  Nhu Binh Ho,et al.  GENACE: an efficient cultural algorithm for solving the flexible job-shop problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[29]  Vinícius Amaral Armentano,et al.  Tardiness minimization in a flexible job shop: A tabu search approach , 2004, J. Intell. Manuf..

[30]  C Riago.  TARDINESS MINIMIZATION IN A FLEXIBLE JOB SHOP: A TABU SEARCH APPROACH , 2004 .

[31]  Lale Özbakir,et al.  Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problems , 2004, J. Intell. Manuf..

[32]  Peter Ross,et al.  Evolutionary Scheduling: A Review , 2005, Genetic Programming and Evolvable Machines.

[33]  Zuobao Wu,et al.  Multiagent scheduling method with earliness and tardiness objectives in flexible job shops , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[34]  Jorge M. S. Valente,et al.  Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time , 2005, Comput. Ind. Eng..

[35]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[36]  I. Sabuncuoglu,et al.  A beam search-based algorithm and evaluation of scheduling approaches for ̄ exible manufacturing systems , 2022 .