Based on MATLAB/SimEvents simulation platform and genetic algorithm, the simulation and optimization of energy consumption in hybrid flow shop is studied. Considering workshop layout and workpiece path, machining process simulation in hybrid flow shop is realized. With the processing time, processing power and stand-by power introduced into simulation model, the energy consumption simulation in...

BACKGROUND Strongyloides stercoralis (SS) is a parasite seen in certain parts of the USA and in people from other endemic areas. In these patients steroids might precipitate or exacerbate asthma. Apart from worsening of asthma, serious complications like hyperinfection syndrome and even death can occur in these patients if treated with steroids. Treatment is either ivermectin or albendazole bas...

This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance.  First the problem is encoded with a...

In this paper, we address the problem of finding a permutation schedule of n jobs in an m machine flow-shop environment that minimizes the maximum completion time Cmax (Makespan) of all jobs. The jobs are available at time zero and have sequence-dependent setup times on each machine. All parameters, such as processing and setup times, are assumed to be known with certainty. This problem is clas...

The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedure where a series of One Machine Sequencing Problems (OMSPs) are solved. However, such a procedure has been reported to be highly ineffective for the Flow Shop problems (Jain and Meeran 2002). In particular, we show th...

Minimizing the makespan is an important research topic in manufacturing engineering because it accounts for significant production expenses. In bakery manufacturing, ovens are high-energy-consuming machines that run throughout time. Finding optimal combination of and oven idle time decisive objective space can result substantial financial savings. This paper investigates hybrid no-wait flow sho...

This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds. © 2004 Elsevier B.V. All rights reserved.

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

Lot sizing and scheduling in flow shop has been considered in this paper. Our study includes a multi-level and multi-period capacitated lot sizing and scheduling problem (CLSP) with sequence-dependent setups, setups carry over in flow shop. In manufacturing environments backlogging is unavoidable. If the production capacity is infinite, any demand can be satisfied