This research presents a novel approach to solve m-machine no-wait flowshop scheduling problem. A continuous flowshop problem with total flowtime as criterion is considered applying a hybrid evolutionary algorithm. The performance of the proposed method is evaluated and the results are compared with the best known in the literature. Experimental tests show the superiority of the evolutionary hy...

Motivated by the current research in data centers and cloud computing, we study the problem of scheduling a set of two-stage jobs on multiple two-stage flowshops. A new formulation for configurations of such scheduling is proposed, which leads directly to improvements to the complexity of scheduling algorithms for the problem. Motivated by the observation that the costs of the two stages can be...

We study a two-stage flowshop, where each job is processed on the first (critical) machine, and then continues to one of two second-stage (dedicated) machines. We assume identical (but machine-dependent) job processing times. Jobs are processed on the critical machine in batches, and a setup time is required when starting a new batch. The setting assumes batch-availability, i.e., jobs become av...

In this paper, we address a two-stage hybrid flowshop scheduling problem with identical parallel machines in each stage. The assumes that the queue (Q)-time for job, which represents waiting time to be processed current stage, must limited predetermined threshold due quality concerns final product. This is motivated by one occurs real field, especially diffusion workstation of semiconductor fab...

This paper presents an improved artificial bee colony (IABC) algorithm for solving the blocking flowshop problem with the objective of minimizing makespan. The proposed IABC algorithm utilizes discrete job permutations to represent solutions and applies insert and swap operators to generate new solutions for the employed and onlooker bees. The differential evolution algorithm is employed to obt...

In this paper we study the classical no-wait flowshop scheduling problem with makespan objective (F |no−wait|Cmax in the standard three-field notation). This problem is well-known to be a special case of the asymmetric traveling salesman problem (ATSP) and as such has an approximation algorithm with logarithmic performance guarantee. In this work we show a reverse connection, we show that any p...

ABSTRACT During the shipbuilding process, a block assembly line suffers bottleneck when largest amount of material is processed. Therefore, scheduling optimization important for productivity. Currently, sequence inbound products controlled by determining input using heuristic or metaheuristic approach. However, algorithm has limitations in that computation time increases exponentially as number...