We address the scheduling problem for a no-wait flow shop to optimize total completion time with release dates. With the tool of asymptotic analysis, we prove that the objective values of two SPTA-based algorithms converge to the optimal value for sufficiently large-sized problems. To further enhance the performance of the SPTA-based algorithms, an improvement scheme based on local search is pr...

flow shop sequencing problem is included in np-hard problems and a number of heuristic methods have been developed to solve it. most of these methods are offered for the crisp processing time. however fuzzy algorithm is appropriate for the problems with fuzzy processing time. this paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

this paper presents a mathematical model for a flow shop scheduling problem consisting of m machine and n jobs with fuzzy processing times that can be estimated as independent stochastic or fuzzy numbers. in the traditional flow shop scheduling problem, the typical objective is to minimize the makespan). however,, two significant criteria for each schedule in stochastic models are: expectable m...

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule isNP -hard in the s...

To address the problems of single evolutionary approach, decreasing diversity, inhomogeneity, and meaningfulness in destruction process when teaching–learning-based optimization (TLBO) algorithm solves no-wait flow-shop-scheduling problem, multi-strategy discrete (MSDTLBO) is introduced. Considering differences between individuals, redefined from student’s point view, giving basic integer seque...

We propose a constructive heuristic for the well known NP-hard problem of no-wait flow shop scheduling. It is based on the assumption that the priority of a job in the sequence is given by the sum of its processing times on the bottleneck machine(s) for selecting the initial sequence of jobs. The computational experimentations show that there is a significant improvement in solution quality ove...