In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...

In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...

We consider the problem of minimizing the makespan(Cmax) on m identical parallel batch processing machines. The batch processing machine can process up to B jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. For a batch of jobs, the processing time of the batch is equal to the largest processing time among the job...

This paper addresses the application of AI techniques in a practical OR problem , i.e. scheduling. Scheduling is a scientific domain concerning the allocation of tasks to a limited set of resources over time. The goal of scheduling is to maximize (or minimize) different optimization criteria such as the makespan (i.e. the completion time of the last operation in the schedule), the occupation ra...

There are essentially two ways to implement a Cellular Manufacturing System (CMS): physical and logical. In the first case, the machines are laid out in the floor space in dedicated manufacturing cells to exploit flow shop efficiency in processing part families, whereas in the second case machines are dedicated to process part families in a process layout. Logical oriented CMS are known as Virt...

This paper presents an efficient heuristic method to minimize total flow time in no-wait flow shop scheduling. It is based on the assumption that the priority of a job in the initial sequence is given by the sum of its processing times on the bottleneck machines. Empirical results demonstrate the superiority of the proposed method over the best-known heuristics in the literature, while remainin...

We consider the movement minimization problem in a conveyor flow shop processing controlled by one worker for all machines. A machine can only execute tasks if the worker is present. Each machine can serve as a bu¤er. The objective is to minimize the total number of movements of the worker for the processing of all jobs. Such minimization problems usually appear in conveyor controlled manufactu...

We consider two generalizations of the proportionate flow shop scheduling problem with the makespan objective. Each job has a processing requirement and each machine has a characteristic value. In our first (second) case we assume that the time a job occupies a machine is the maximum (minimum) of the processing requirement of the job and the characteristic value of the machine. We show that the...

This paper presents a predictive robust and stable approach for two-machine flow shop scheduling problem with machine disruption uncertain job processing time. Indeed, general is proposed that can be used robustness stability optimization in an m-machine or problem. The measure the total expected realized completion sum of squared aberration between each jobs’ time initial schedules measure. We...