Research on Limited Buffer Scheduling Problems in Flexible Flow Shops with Setup Times

by   Zhonghua Han, et al.

In order to solve the limited buffer scheduling problems in flexible flow shops with setup times, this paper proposes an improved whale optimization algorithm (IWOA) as a global optimization algorithm. Firstly, this paper presents a mathematic programming model for limited buffer in flexible flow shops with setup times, and applies the IWOA algorithm as the global optimization algorithm. Based on the whale optimization algorithm (WOA), the improved algorithm uses Levy flight, opposition-based learning strategy and simulated annealing to expand the search range, enhance the ability for jumping out of local extremum, and improve the continuous evolution of the algorithm. To verify the improvement of the proposed algorithm on the optimization ability of the standard WOA algorithm, the IWOA algorithm is tested by verification examples of small-scale and large-scale flexible flow shop scheduling problems, and the imperialist competitive algorithm (ICA), bat algorithm (BA), and whale optimization algorithm (WOA) are used for comparision. Based on the instance data of bus manufacturer, simulation tests are made on the four algorithms under variouis of practical evalucation scenarios. The simulation results show that the IWOA algorithm can better solve this type of limited buffer scheduling problem in flexible flow shops with setup times compared with the state of the art algorithms.


A Novel Metaheuristics To Solve Mixed Shop Scheduling Problems

This paper represents the metaheuristics proposed for solving a class of...

Bus Manufacturing Workshop Scheduling Method with Routing Buffer

Aiming at solving the problem that the moving route is complicated and t...

Swarm Intelligent Algorithm For Re-entrant Hybrid Flow shop Scheduling Problems

In order to solve Re-entrant Hybrid Flowshop (RHFS) scheduling problems ...

A Flexible Storage Model for Power Network Optimization

This paper proposes a simple and flexible storage model for use in a var...

Order Acceptance and Scheduling with Sequence-dependent Setup Times: a New Memetic Algorithm and Benchmark of the State of the Art

The Order Acceptance and Scheduling (OAS) problem describes a class of r...

Plan-based Job Scheduling for Supercomputers with Shared Burst Buffers

The ever-increasing gap between compute and I/O performance in HPC platf...