A Local Search Algorithm for the Flow Shop Scheduling Problem with Release Dates

Abstract

This paper discusses the flow shop scheduling problem to minimize the makespan with release dates. By resequencing the jobs, a modified heuristic algorithm is obtained for handling large-sized problems. Moreover, based on some properties, a local search scheme is provided to improve the heuristic to gain high-quality solution for moderate-sized problems. A sequence-independent lower bound is presented to evaluate the performance of the algorithms. A series of simulation results demonstrate the effectiveness of the proposed algorithms.

On a Flow-Shop Scheduling Problem with Fuzzy Pentagonal Processing Time

“…(1) For M 1 : processing time min is (2, 6, 8, 10, 14) (2) For M 2 : processing time max is (2,5,7,8,9) (3) For M 3 : processing time min is (1,3,4,5,6) Here, all the decision parameters are represented by pentagonal fuzzy numbers.…”

“…Vahedi-Nouri et al [2] presented a more broad version of the FS strategy to minimize the average flow rate. In order to optimize the publication time, Ren et al [3] explored the topic of FS programming. Laribi et al [4] have introduced a mathematical model for two FS-limited machines that address FS time reduction problems where renewables are not constrained.…”