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...

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...

The paper considers a two machine flow shop scheduling problem with no wait in process. The objective is to find the optimal values of machine speeds and to determine the time-optimal schedule. There are two machines, A and B, and a set of n jobs each consisting of two operations. The first operation of each job is to be processed on machine A and the second on machine B. For each feasible sche...

No wait flow shop scheduling problem (NWFSP) by minimizing make-span is an NP-hard problem with various applications in the industry. In this paper a new lower bound for NWFSP is presented. For this, the MIP model of the problem is relaxed and dived into two separate problems with polynomial solution. Then by applying Lagrangian relaxation method an algorithm is present to obtain a lower-bound....

We study the two-machine flow shop scheduling problem with no-wait in process, in which one of the machines is not available during a given time interval. The objective is to minimize the makespan. The problem is known to be NP-hard, and in the case of several non-availability intervals is not approximable within a constant factor. We consider all possible scenarios of handling the operation af...

The No-Wait Job Shop (NWJS) considered here is a version of the job shop scheduling problem where, for any two operations of a job, a fixed time lag between their starting times is given. Also, sequence-dependent set-up times between consecutive operations on a machine can be present. The NWJS problem consists in finding a schedule that minimizes the makespan. We address here the so-called Opti...

Sequencing and scheduling are forms of decision making which play a key role in manufacturing. This paper presents the description of a scheduling algorithm for the solution of the no-wait ̄ow-shop problem. The goal of the heuristic is to minimise the sum of the total ̄owtimes, a criterion which at the same time minimises the average processing time. This is a sensible target in applications su...