We investigate the approximability of no-wait permutation flow shop scheduling problem under the makespan criterion. We present a polynomial time approximation scheme (PTAS) for problem on any fixed number of machines.

Received: 1 June 2015 Abstract Accepted: 30 July 2015 The uncertain flow-shop is considered. It is assumed that processing times are not given a priori, but they belong to intervals of known bounds. The absolute regret (regret) is used to evaluate a solution (a schedule) which gives the minmax regret binary optimization problem. The evolutionary heuristic solution algorithm is experimentally co...

Flow shop scheduling is a type of where sequence follows for each job on set machines processing. In practice, jobs in flow shops can arrive at irregular times, and the no-wait constraint allows changes order to flexibly manage such irregularity. The flexible problems with have mainly addressed optimization floor manufacturing, processing, allied industries. scope this paper identify literature...

This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing can be resumed when the machine next becomes available, and the semi-resumable scenarios in which some proportion of the processing is repeated b...

We consider the problem of on-line scheduling a set of n jobs on two parallel batch processing machines. Each machine can handle an infinite number of jobs as a batch simultaneously. The processing time of a batch is the time required for processing the longest job in the batch. Each job becomes available at its release date, which is not known in advance, and its processing time only becomes k...

Batch processing becomes more important in the process industries, because of the increasing product variety and the decreasing demand volumes for individual products. In batch process industries it is difficult to predict the completion time, or makespan, of a set of jobs, because jobs interact at the shop floor. In this paper, we compare two different methods for predicting the makespan of jo...

Continuous flow-shop scheduling problems circumscribe an important class of sequencing problems in the field of production planning. The problem considered here is to find a permutation of jobs to be processed sequentially on a number of machines under the restriction that the processing of each job has to be continuous with respect to the objective of minimizing the total processing time (flow...

This paper deals with semi-online scheduling on two parallel batch processing machines with jobs’ nondecreasing processing times. Our objective is to minimize the makespan. A batch processing machine can handle up to B jobs simultaneously. We study unbounded model which means that B is sufficiently large. The jobs that are processed together construct a batch, and all jobs in a batch start and ...